Sciweavers

402 search results - page 42 / 81
» Nearest Surrounder Queries
Sort
View
FOCS
2006
IEEE
14 years 1 months ago
On the Optimality of the Dimensionality Reduction Method
We investigate the optimality of (1+ )-approximation algorithms obtained via the dimensionality reduction method. We show that: • Any data structure for the (1 + )-approximate n...
Alexandr Andoni, Piotr Indyk, Mihai Patrascu
CCCG
2010
13 years 9 months ago
Fast local searches and updates in bounded universes
Given a bounded universe {0, 1, . . . , U-1}, we show how to perform (successor) searches in O(log log ) expected time and updates in O(log log ) expected amortized time, where i...
Prosenjit Bose, Karim Douïeb, Vida Dujmovic, ...
CIVR
2010
Springer
187views Image Analysis» more  CIVR 2010»
14 years 17 days ago
Mixture model based contextual image retrieval
Traditional image retrieval techniques search for images without considering the query context. When they are applied to applications like annotating text with images, the results...
Xing Xing, Yi Zhang, Bo Gong
ICDE
2010
IEEE
176views Database» more  ICDE 2010»
13 years 8 months ago
CareDB: A context and preference-aware location-based database system
— In this paper, we aim to realize a context and preference-aware database system, CareDB, that provides scalable personalized location-based services to users based on their pre...
Justin J. Levandoski, Mohamed F. Mokbel
SIGMOD
2011
ACM
202views Database» more  SIGMOD 2011»
12 years 10 months ago
Flexible aggregate similarity search
Aggregate similarity search, a.k.a. aggregate nearest neighbor (Ann) query, finds many useful applications in spatial and multimedia databases. Given a group Q of M query objects...
Yang Li, Feifei Li, Ke Yi, Bin Yao 0002, Min Wang