When designing hardware or software, it is important to ensure that systems behave correctly. This is particularly crucial for life- or safety-critical systems, in which errors can be fatal. One approach to the formal ...
Image compression algorithms have evolved into some of the most complex structures in computing. Yet at the core of these algorithms are simple techniques that have been long known about data compression. This paper explores ...
In this paper, we consider two problems related to counting problems in complexity theory. First, we use the reachability method to prove that nondeterministic logarithm space is closed under complement. Then, we consider ...
Optimization of route planning is essential to everyday tasks such as planning trips and traffic simulation. In order to optimize routes in large graphs such as transportation networks, an algorithm must be able to quickly ...
One of the most fundamental concepts in graph theory is connectivity, or the property that a path exists between two vertices in a given graph. The property of connectivity may be extended into biconnectivity and ...
Axiomatization in finite model theory is the process of finding a set of axiom formulas from which all other formulas in a theory can be derived. Applied to the theory of a structure like "binary strings" or "natural number ...
This paper is an empirical study mainly of graph properties for various graphs including both deterministic graphs, those with a set structure, and random graphs. The main properties that are analyzed are graph diameter, ...
Fast distance querying in certain types of graphs is often used in databases, ranked keyword search, XML databases, social networks, games and for other purposes. As graphs within these categories get larger and larger, ...
This paper is a survey of the algorithms that power recommender systems. To start, the social and monetary relevance of recommender systems is outlined. Then we delve into the specifics of how the first recommender system, ...
Reversible computing is the paradigm in which every computation is physically and easily reversible in an unambiguous way. For a reversible machine, this would apply to programs, gates, memory, and everything in between. ...
We collect the proofs and lemmas which enable linear time algorithms for first-order sentences on graph classes with bounded expansion. Bounded expansion is a property limiting the edge to vertex ratio of a graph and its ...
An exploration of previous work on planarity with a relatively simple and complete proof of Kuratowski's theorem and an in depth explanation of the foundations of the Left-Right Planarity algorithm.
Combinatorial auctions are economically efficient mechanisms to allocate multiple, potentially synergistic or substitutable items. Despite their economic advantages, however, computational difficulties in implementation ...
The vision for Web 3.0 (popularly referred to as the Semantic Web) is the ability to create meaning out of a deluge of qualitative data. This paper explores a very specific instance of the Semantic Web – Social Recommender ...
Traditionally, artificial intelligence (AI) algorithms have not been built on particularly adaptive principles. Systems were created using complex collections of rules that were created specifically for the purpose at hand, ...