210 search results - page 12 / 42 » On the Structure of Bounded Queries to Arbitrary NP Sets |
SIGMETRICS
2011
ACM
12 years 11 months ago
2011
ACM
The massive data streams observed in network monitoring, data processing and scientific studies are typically too large to store. For many applications over such data, we must ob...
MIR
2010
ACM
13 years 8 months ago
2010
ACM
Ideally, one would like to perform image search using an intuitive and friendly approach. Many existing image search engines, however, present users with sets of images arranged i...
ECCC
2011
13 years 3 months ago
2011
Locally decodable codes are error correcting codes with the extra property that, in order to retrieve the correct value of just one position of the input with high probability, it...
ICDT
2005
ACM
14 years 2 months ago
2005
ACM
The existence of a language expressing precisely the PTIME queries on arbitrary structures remains the central open problem in the theory of database query languages. As it turns o...
FOCS
2003
IEEE
14 years 1 months ago
2003
IEEE
We give a complexity theoretic classification of homomorphism problems for graphs and, more generally, relational structures obtained by restricting the left hand side structure ...