187 search results - page 35 / 38 » Coloring linear orders with Rado's partial order |
SIROCCO
2007
13 years 8 months ago
2007
We consider the problem of periodic exploration of all nodes in undirected graphs by using a nite state automaton called later a robot. The robot, using a constant number of state...
PODS
1995
ACM
13 years 11 months ago
1995
ACM
Databases are often incomplete because of the presence of disjunctive information, due to con icts, partial knowledge and other reasons. Queries against such databases often ask q...
NHM
2010
13 years 2 months ago
2010
We introduce the coolest path problem, which is a mixture of two well-known problems from distinct mathematical fields. One of them is the shortest path problem from combinatorial ...
EMSOFT
2006
Springer
13 years 11 months ago
2006
Springer
Bridging the gap between model-based design and platformbased implementation is one of the critical challenges for embedded software systems. In the context of embedded control sy...
EDBT
2009
ACM
14 years 2 months ago
2009
ACM
In this paper we consider distributed K-Nearest Neighbor (KNN) search and range query processing in high dimensional data. Our approach is based on Locality Sensitive Hashing (LSH...