Sciweavers

1038 search results - page 69 / 208
» Space-Bounded Query Approximation
Sort
View
ICMCS
2009
IEEE
205views Multimedia» more  ICMCS 2009»
15 years 8 days ago
Bregman vantage point trees for efficient nearest Neighbor Queries
Nearest Neighbor (NN) retrieval is a crucial tool of many computer vision tasks. Since the brute-force naive search is too time consuming for most applications, several tailored d...
Frank Nielsen, Paolo Piro, Michel Barlaud
ECAI
2004
Springer
15 years 8 months ago
Querying the Semantic Web with Corese Search Engine
This paper presents an ontology-based approach for web querying, using semantic metadata. We propose a query language based on ontologies and emphasize its ability to express appro...
Olivier Corby, Rose Dieng-Kuntz, Catherine Faron-Z...
165
Voted
STOC
2012
ACM
221views Algorithms» more  STOC 2012»
13 years 5 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
231
Voted
ICDE
2008
IEEE
190views Database» more  ICDE 2008»
16 years 3 months ago
Efficient Query Processing in Large Traffic Networks
Abstract-- We present an original graph embedding to speedup distance-range and k-nearest neighbor queries on static and/or dynamic objects located on a (weighted) graph. Our metho...
Hans-Peter Kriegel, Matthias Renz, Peer Kröge...
100
Voted
PERCOM
2007
ACM
16 years 2 months ago
Data Quality and Query Cost in Wireless Sensor Networks
This research is motivated by emerging, real-world wireless sensor network applications for monitoring and control. We examine the benefits and costs of caching data for such appli...
David J. Yates, Erich M. Nahum, Jim Kurose, Prasha...