Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Mathematics (21)
- Statistics and Probability (19)
- Engineering (13)
- Electrical and Computer Engineering (6)
- Medicine and Health Sciences (3)
-
- Operations Research, Systems Engineering and Industrial Engineering (3)
- Health Information Technology (2)
- Information Security (2)
- Aerospace Engineering (1)
- Cybersecurity (1)
- Economics (1)
- Education (1)
- Higher Education (1)
- Medical Pathology (1)
- Medical Sciences (1)
- Social and Behavioral Sciences (1)
- Institution
- Keyword
-
- Automated Induction, Machine Learning, Knowledge Representation (4)
- Algorithms (3)
- Algorithm Design (2)
- Application-Oriented Fault Tolerance, Multicomputers. (2)
- Chromatic Number (2)
-
- Embedding, Fault Tolerance, Reconfiguration, Ring, Hypercube. (2)
- Embeddings (2)
- Graph-Coloring (2)
- Heuristic Algorithms (2)
- Optimization, Probabilistic Methods, Stock Cutting, Bin Packing (2)
- Reasoning (2)
- Scheduling (2)
- Speedup (2)
- Academic/Educational Applications (1)
- Approximation (1)
- Artificial Intelligence, Database Rule Systems, Rule Indexing, Rule Clustering, Search Strategies, Rule-base. (1)
- Artificial intelligence (1)
- Bibliography (1)
- Branch-And-Bound (1)
- Church-Rosser Property (1)
- Class NC (1)
- Class NG (1)
- Compilers, Formal Languages, Language Processors, LR(l) Grammars, LR(l) Parsing (1)
- Complete Sets of Reductions (1)
- Complexity Of Algorithms (1)
- Computer assisted instruction (1)
- Conant gasket (1)
- Concurrent Systems (1)
- Conditional Reductions (1)
- Cyber resilience (1)
- Publication Year
- File Type
Articles 91 - 120 of 772
Full-Text Articles in Computer Sciences
Scalable Object-Class Search Via Sparse Retrieval Models And Approximate Ranking, Mohammad Rastegari, Chen Fang, Lorenzo Torresani
Scalable Object-Class Search Via Sparse Retrieval Models And Approximate Ranking, Mohammad Rastegari, Chen Fang, Lorenzo Torresani
Computer Science Technical Reports
In this paper we address the problem of object-class retrieval in large image data sets: given a small set of training examples defining a visual category, the objective is to efficiently retrieve images of the same class from a large database. We propose two contrasting retrieval schemes achieving good accuracy and high efficiency. The first exploits sparse classification models expressed as linear combinations of a small number of features. These sparse models can be efficiently evaluated using inverted file indexing. Furthermore, we introduce a novel ranking procedure that provides a significant speedup over inverted file indexing when the goal is …
A New Artificial Intelligence For Auralux, Edward Mcneill
A New Artificial Intelligence For Auralux, Edward Mcneill
Computer Science Technical Reports
This project focused on developing a more challenging artificial intelligence for the real-time strategy game Auralux. I designed and implemented an AI framework named FlexibleAI that could be configured with various parameters controlling different aspects of the overall algorithm. In this way, the AI could be tuned to be more successful. I then created a testing framework called AuraSim that simplified Auralux into an easily-simulated turn-based format. After testing various configurations and tuning the FlexibleAI's parameters to be more successful, the AI eventually achieved a victory rate several times better than its average opponent. This provides the basis for a …
Exploiting The Hard-Working Dwarf: Trojans With No Native Executable Code, James Oakley, Sergey Bratus
Exploiting The Hard-Working Dwarf: Trojans With No Native Executable Code, James Oakley, Sergey Bratus
Computer Science Technical Reports
All binaries compiled by recent versions of GCC from C++ programs include complex data and dedicated code for exception handling support. The data structures describe the call stack frame layout in the DWARF format bytecode. The dedicated code includes an interpreter of this bytecode and logic to implement the call stack unwinding. Despite being present in a large class of programs -- and therefore potentially providing a huge attack surface -- this mechanism is not widely known or studied. Of particular interest to us is that the exception handling mechanism provides the means for fundamentally altering the flow of a …
Tr-2011007: Randomized And Derandomized Matrix Computations, Victor Y. Pan, Guoliang Qian, Ai-Long Zheng
Tr-2011007: Randomized And Derandomized Matrix Computations, Victor Y. Pan, Guoliang Qian, Ai-Long Zheng
Computer Science Technical Reports
No abstract provided.
Tr-2011004: Acceleration Of Newton's Polynomial Factorization: Army Of Constraints, Convolution, Sylvester Matrices, And Partial Fraction Decomposition, Victor Y. Pan
Computer Science Technical Reports
No abstract provided.
Tr-2011005: First-Order Logic Of Proofs, Sergei N. Artemov, Tatiana Yavorskaya (Sidon)
Tr-2011005: First-Order Logic Of Proofs, Sergei N. Artemov, Tatiana Yavorskaya (Sidon)
Computer Science Technical Reports
No abstract provided.
Tr-2011011: Randomized And Derandomized Matrix Computations Ii, Victor Y. Pan, Guoliang Qian, Ai-Long Zheng
Tr-2011011: Randomized And Derandomized Matrix Computations Ii, Victor Y. Pan, Guoliang Qian, Ai-Long Zheng
Computer Science Technical Reports
No abstract provided.
Tr-2011010: Possible World Semantics For First Order Lp, Melvin Fitting
Tr-2011010: Possible World Semantics For First Order Lp, Melvin Fitting
Computer Science Technical Reports
No abstract provided.
Tr-2011002: Symbolic Lifting For Structured Linear Systems Of Equations: Numerical Initialization, Nearly Optimal Boolean Cost, Variations, And Extensions, Victor Y. Pan
Computer Science Technical Reports
No abstract provided.
Tr-2011003: Partial Fraction Decomposition, Sylvester Matrices, Convolution And Newton's Iteration, Victor Y. Pan
Tr-2011003: Partial Fraction Decomposition, Sylvester Matrices, Convolution And Newton's Iteration, Victor Y. Pan
Computer Science Technical Reports
No abstract provided.
Tr-2011008: The Ontology Of Justifications In The Logical Setting, Sergei N. Artemov
Tr-2011008: The Ontology Of Justifications In The Logical Setting, Sergei N. Artemov
Computer Science Technical Reports
No abstract provided.
Tr-2011009: Solving Linear Systems Of Equations With Randomized Augmentation And Aggregation, Victor Y. Pan, Guoliang Qian
Tr-2011009: Solving Linear Systems Of Equations With Randomized Augmentation And Aggregation, Victor Y. Pan, Guoliang Qian
Computer Science Technical Reports
No abstract provided.
Privacy Analysis Of User Association Logs In A Large-Scale Wireless Lan, Keren Tan, Guanhua Yan, Jihwang Yeo, David Kotz
Privacy Analysis Of User Association Logs In A Large-Scale Wireless Lan, Keren Tan, Guanhua Yan, Jihwang Yeo, David Kotz
Computer Science Technical Reports
User association logs collected from a large-scale wireless LAN record where and when a user has used the network. Such information plays an important role in wireless network research. One concern of sharing these data with other researchers, however, is that the logs pose potential privacy risks for the network users. Today, the common practice in sanitizing these data before releasing them to the public is to anonymize users' sensitive information, such as their devices' MAC addresses and their exact association locations. In this work, we demonstrate that such sanitization measures are insufficient to protect user privacy because the differences …
Detecting Photographic Composites Of Famous People, Eric Kee, Hany Farid
Detecting Photographic Composites Of Famous People, Eric Kee, Hany Farid
Computer Science Technical Reports
Photos are commonly falsified by compositing two or more people into a single image. We describe how such composites can be detected by estimating a camera's intrinsic parameters. Differences in these parameters across the image are then used as evidence of tampering. Expanding on earlier work, this approach is more applicable to low-resolution images, but requires a reference image of each person in the photo as they are directly facing the camera. When considering composites of famous people, such a reference photo is easily obtained from an on-line image search.
A 3-D Photo Forensic Analysis Of The Lee Harvey Oswald Backyard Photo, Hany Farid
A 3-D Photo Forensic Analysis Of The Lee Harvey Oswald Backyard Photo, Hany Farid
Computer Science Technical Reports
More than forty-five years after the assassination of U.S. President Kennedy theories continue to circulate suggesting that the accused assassin, Lee Harvey Oswald, acted as part of a larger conspiracy. It has been argued, for example, that incriminating photographs of Oswald were manipulated, and hence evidence of a broader plot. We describe a detailed 3-D analysis of the Oswald photos to determine if such claims of tampering are warranted.
A Note On Randomized Streaming Space Bounds For The Longest Increasing Subsequence Problem, Amit Chakrabarti
A Note On Randomized Streaming Space Bounds For The Longest Increasing Subsequence Problem, Amit Chakrabarti
Computer Science Technical Reports
The deterministic space complexity of approximating the length of the longest increasing subsequence of a stream of N integers is known to be Theta~(sqrt N). However, the randomized complexity is wide open. We show that the technique used in earlier work to establish the Omega(sqrt N) deterministic lower bound fails strongly under randomization: specifically, we show that the communication problems on which the lower bound is based have very efficient randomized protocols. The purpose of this note is to guide and alert future researchers working on this very interesting problem.
Constant Rmr Solutions To Reader Writer Synchronization, Vibhor Bhatt, Prasad Jayanti
Constant Rmr Solutions To Reader Writer Synchronization, Vibhor Bhatt, Prasad Jayanti
Computer Science Technical Reports
We study Reader-Writer Exclusion, a well-known variant of the Mutual Exclusion problem where processes are divided into two classes--readers and writers--and multiple readers can be in the Critical Section (CS) at the same time, although no process may be in the CS at the same time as a writer. Since readers don't conflict with each other, they should not obstruct each other. Specifically, the concurrent entering property must be satisfied: if all writers are in the remainder section, each reader should be able to enter the CS in a bounded number of its own steps. Three versions of the Reader-Writer …
Tr-2010012: Randomized Preconditioning Of Linear Systems Of Equations, Victor Y. Pan, Guoliang Qian, Ai-Long Zheng
Tr-2010012: Randomized Preconditioning Of Linear Systems Of Equations, Victor Y. Pan, Guoliang Qian, Ai-Long Zheng
Computer Science Technical Reports
No abstract provided.
Tr-2010013: Matrix Computations And Polynomial Root-Finding With Preprocessing, Victor Y. Pan, Guoliang Qian, Ai-Long Zheng, Zhao Chen
Tr-2010013: Matrix Computations And Polynomial Root-Finding With Preprocessing, Victor Y. Pan, Guoliang Qian, Ai-Long Zheng, Zhao Chen
Computer Science Technical Reports
No abstract provided.
Tr-2010014: A Complexity Question In Justification Logic, Antonis Achilleos
Tr-2010014: A Complexity Question In Justification Logic, Antonis Achilleos
Computer Science Technical Reports
No abstract provided.
Tr-2010015: New Progress In Real And Complex Polynomial Root-Finding, Victor Y. Pan, Ai-Long Zheng
Tr-2010015: New Progress In Real And Complex Polynomial Root-Finding, Victor Y. Pan, Ai-Long Zheng
Computer Science Technical Reports
No abstract provided.
Tr-2010009: Solving Linear Systems With Randomized Augmentation Ii, Victor Y. Pan, Guoliang Qian
Tr-2010009: Solving Linear Systems With Randomized Augmentation Ii, Victor Y. Pan, Guoliang Qian
Computer Science Technical Reports
No abstract provided.
Tr-2010002: Reasoning About Games, Melvin Fitting
Tr-2010002: Reasoning About Games, Melvin Fitting
Computer Science Technical Reports
No abstract provided.
Tr-2010003: The Impossibility Of Definitive Solutions For Some Games, Sergei Artemov
Tr-2010003: The Impossibility Of Definitive Solutions For Some Games, Sergei Artemov
Computer Science Technical Reports
No abstract provided.
Tr-2010005: Securing Bgp Through Existing Infrastructure And Contractual Chains (Ccbgp), Yuri Cantor, Nancy Griffeth, Bilal Khan, Ping Ji
Tr-2010005: Securing Bgp Through Existing Infrastructure And Contractual Chains (Ccbgp), Yuri Cantor, Nancy Griffeth, Bilal Khan, Ping Ji
Computer Science Technical Reports
No abstract provided.
Tr-2010007: Robust Knowledge Of Rationality, Sergei Artemov
Tr-2010007: Robust Knowledge Of Rationality, Sergei Artemov
Computer Science Technical Reports
No abstract provided.
Tr-2010008: Knowability From A Logical Point Of View, Sergei Artemov, Tudor Protopopescu
Tr-2010008: Knowability From A Logical Point Of View, Sergei Artemov, Tudor Protopopescu
Computer Science Technical Reports
No abstract provided.
Tr-2010010: Robust Knowledge And Rationality, Sergei Artemov
Tr-2010010: Robust Knowledge And Rationality, Sergei Artemov
Computer Science Technical Reports
No abstract provided.
Tr-2010011: Randomized Preprocessing Versus Pivoting Ii, Victor Y. Pan, Guoliang Qian, Ai-Long Zheng
Tr-2010011: Randomized Preprocessing Versus Pivoting Ii, Victor Y. Pan, Guoliang Qian, Ai-Long Zheng
Computer Science Technical Reports
No abstract provided.
Tr-2010004: Tracking Evidence, Sergei Artemov
Tr-2010004: Tracking Evidence, Sergei Artemov
Computer Science Technical Reports
No abstract provided.