Sciweavers

466 search results - page 64 / 94
» Efficient Object Querying for Java
Sort
View
ICDE
2007
IEEE
185views Database» more  ICDE 2007»
15 years 11 months ago
On k-Nearest Neighbor Searching in Non-Ordered Discrete Data Spaces
A k-nearest neighbor (k-NN) query retrieves k objects from a database that are considered to be the closest to a given query point. Numerous techniques have been proposed in the p...
Dashiell Kolbe, Qiang Zhu, Sakti Pramanik
CGF
2008
139views more  CGF 2008»
14 years 10 months ago
CHC++: Coherent Hierarchical Culling Revisited
We present a new algorithm for efficient occlusion culling using hardware occlusion queries. The algorithm significantly improves on previous techniques by making better use of te...
Oliver Mattausch, Jirí Bittner, Michael Wim...
SIGMOD
2010
ACM
132views Database» more  SIGMOD 2010»
14 years 4 months ago
Durable top-k search in document archives
We propose and study a new ranking problem in versioned databases. Consider a database of versioned objects which have different valid instances along a history (e.g., documents i...
Leong Hou U, Nikos Mamoulis, Klaus Berberich, Srik...
SIGMOD
2010
ACM
239views Database» more  SIGMOD 2010»
14 years 10 months ago
Call to order: a hierarchical browsing approach to eliciting users' preference
Computing preference queries has received a lot of attention in the database community. It is common that the user is unsure of his/her preference, so care must be taken to elicit...
Feng Zhao, Gautam Das, Kian-Lee Tan, Anthony K. H....
CVPR
2009
IEEE
16 years 5 months ago
Learning query-dependent prefilters for scalable image retrieval
We describe an algorithm for similar-image search which is designed to be efficient for extremely large collections of images. For each query, a small response set is selected by...
Lorenzo Torresani (Dartmouth College), Martin Szum...