14548 search results - page 2591 / 2910 » The Optimal Path-Matching Problem |
170
click to vote
CADE
2006
Springer
16 years 7 months ago
2006
Springer
Context Unification is the problem to decide for a given set of second-order equations E where all second-order variables are unary, whether there exists a unifier, such that for e...
187
click to vote
STOC
2007
ACM
16 years 7 months ago
2007
ACM
The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has ap...
185
click to vote
STOC
2003
ACM
16 years 7 months ago
2003
ACM
Many algorithms and data structures employing hashing have been analyzed under the uniform hashing assumption, i.e., the assumption that hash functions behave like truly random fu...
289
click to vote
SIGMOD
2009
ACM
16 years 6 months ago
2009
ACM
With the proliferation of the RDF data format, engines for RDF query processing are faced with very large graphs that contain hundreds of millions of RDF triples. This paper addre...
262
Voted
SIGMOD
2007
ACM
16 years 6 months ago
2007
ACM
In response to the widespread use of the XML format for document representation and message exchange, major database vendors support XML in terms of persistence, querying and inde...