Sciweavers

1888 search results - page 163 / 378
» Algorithms for Querying by Spatial Structure
Sort
View
DIALM
1999
ACM
127views Algorithms» more  DIALM 1999»
15 years 8 months ago
The performance of query control schemes for the zone routing protocol
—In this paper, we study the performance of route query control mechanisms for the Zone Routing Protocol (ZRP) for ad hoc networks. ZRP proactively maintains routing information ...
Zygmunt J. Haas, Marc R. Pearlman
NIPS
2007
15 years 5 months ago
A learning framework for nearest neighbor search
Can we leverage learning techniques to build a fast nearest-neighbor (ANN) retrieval data structure? We present a general learning framework for the NN problem in which sample que...
Lawrence Cayton, Sanjoy Dasgupta
SSDBM
2011
IEEE
239views Database» more  SSDBM 2011»
14 years 8 months ago
Recipes for Baking Black Forest Databases - Building and Querying Black Hole Merger Trees from Cosmological Simulations
Large-scale N-body simulations play an important role in advancing our understanding of the formation and evolution of large structures in the universe. These computations require ...
Julio López, Colin Degraf, Tiziana DiMatteo...
ICDCS
2008
IEEE
15 years 11 months ago
Routing of XML and XPath Queries in Data Dissemination Networks
XML-based data dissemination networks are rapidly gaining momentum. In these networks XML content is routed from data producers to data consumers throughout an overlay network of ...
Guoli Li, Shuang Hou, Hans-Arno Jacobsen
STOC
2012
ACM
221views Algorithms» more  STOC 2012»
13 years 6 months ago
From query complexity to computational complexity
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
Shahar Dobzinski, Jan Vondrák