493 search results - page 42 / 99 » Quantum Query Complexity of Some Graph Problems |
SIGMOD
2011
ACM
14 years 15 days ago
2011
ACM
In this paper we consider the problem of answering queries using views, which is important for data integration, query optimization, and data warehouses. We consider its simplest ...
158
click to vote
ICDE
2004
IEEE
15 years 11 months ago
2004
IEEE
As information becomes available in increasing amounts to a wide spectrum of users, the need for a shift towards a more user-centered information access paradigm arises. We develo...
100
click to vote
WWW
2008
ACM
15 years 10 months ago
2008
ACM
Efficiently querying RDF [1] data is being an important factor in applying Semantic Web technologies to real-world applications. In this context, many efforts have been made to st...
ESA
2007
Springer
15 years 3 months ago
2007
Springer
Given a graph G = (V, E), a (d, k)-coloring is a function from the vertices V to colors {1, 2, . . . , k} such that any two vertices within distance d of each other are assigned di...
TAMC
2009
Springer
15 years 4 months ago
2009
Springer
In this paper we define the notion of an f(k)-uniform parameterized exponential time scheme. We show that a problem can be solved in parameterized O(2o(f(k)) p(n)) time if and on...