493 search results - page 40 / 99 » Quantum Query Complexity of Some Graph Problems |
IPSN
2009
Springer
15 years 4 months ago
2009
Springer
In this work we present new in-network techniques for communication efficient approximate query processing in wireless sensornets. We use a model-based approach that constructs a...
125
Voted
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
128
click to vote
VDA
2010
15 years 2 days ago
2010
While there have been intensive efforts in developing better 3D flow visualization techniques, little attention has been paid to the design of better user interfaces and more effe...
PODS
2004
ACM
15 years 9 months ago
2004
ACM
We study the problem of answering queries over sources with limited access patterns. Given a first-order query Q, the problem is to decide whether there is an equivalent query whi...
MDM
2009
Springer
15 years 4 months ago
2009
Springer
— This work aims at minimize the cost of answering snapshot multi-predicate queries in high-communication-cost networks. High-communication-cost (HCC) networks is a family of net...