415 search results - page 19 / 83 » Optimal query complexity bounds for finding graphs |
VLDB
2002
ACM
14 years 7 months ago
2002
ACM
: Purpose ? Tree pattern is at the core of XML queries. The tree patterns in XML queries typically contain redundancies, especially when broad integrity constraints (ICs) are prese...
SODA
2004
ACM
13 years 9 months ago
2004
ACM
We prove that any one-pass streaming algorithm which ( , )-approximates the kth frequency moment Fk, for any real k = 1 and any = 1 m , must use 1 2 bits of space, where m is th...
ICRA
2010
IEEE
13 years 6 months ago
2010
IEEE
— This paper presents a thorough analysis of the computational complexity of optimal reconfiguration planning problem for chain-type modular robots, i.e. finding the least number...
PODS
2008
ACM
14 years 7 months ago
2008
ACM
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...
DNA
2006
Springer
13 years 11 months ago
2006
Springer
We study the complexity of the Accretive Graph Assembly Problem (AGAP). An instance of AGAP consists of an edge-weighted graph G, a seed vertex in G, and a temperature . The goal i...