3341 search results - page 264 / 669 » On Bounded Queries and Approximation |
176
click to vote
COCO
2008
Springer
15 years 8 months ago
2008
Springer
We present a new variant of the quantum adversary method. All adversary methods give lower bounds on the quantum query complexity of a function by bounding the change of a progres...
319
click to vote
ICDE
2009
IEEE
16 years 8 months ago
2009
IEEE
Large databases with uncertain information are becoming more common in many applications including data integration, location tracking, and Web search. In these applications, ranki...
173
click to vote
STOC
2001
ACM
16 years 7 months ago
2001
ACM
We consider static one dimensional range searching problems. These problems are to build static data structures for an integer set S U, where U = {0, 1, . . . , 2w - 1}, which su...
164
click to vote
CSE
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract—Extensive work has been devoted to private information retrieval and privacy preserving data mining. To protect user privacy from search engines, however, most current a...
162
click to vote
ICDCSW
2005
IEEE
16 years 8 days ago
2005
IEEE
Existing cluster-based searching schemes in unstructured peer-to-peer (P2P) networks employ flooding/random forwarding on connected dominating sets (CDS) of networks. There exist...