Sciweavers

329 search results - page 12 / 66
» On Range Searching with Semialgebraic Sets
Sort
View
SODA
2004
ACM
155views Algorithms» more  SODA 2004»
13 years 10 months ago
Navigating nets: simple algorithms for proximity search
d Abstract] Robert Krauthgamer James R. Lee We present a simple deterministic data structure for maintaining a set S of points in a general metric space, while supporting proximit...
Robert Krauthgamer, James R. Lee
TREC
2004
13 years 10 months ago
Language Models for Searching in Web Corpora
: We describe our participation in the TREC 2004 Web and Terabyte tracks. For the web track, we employ mixture language models based on document full-text, incoming anchortext, and...
Jaap Kamps, Gilad Mishne, Maarten de Rijke
TOG
2012
253views Communications» more  TOG 2012»
11 years 11 months ago
Exploring collections of 3D models using fuzzy correspondences
Large collections of 3D models from the same object class (e.g., chairs, cars, animals) are now commonly available via many public repositories, but exploring the range of shape v...
Vladimir G. Kim, Wilmot Li, Niloy J. Mitra, Stephe...
SIGMOD
2002
ACM
219views Database» more  SIGMOD 2002»
14 years 8 months ago
Efficient k-NN search on vertically decomposed data
Applications like multimedia retrieval require efficient support for similarity search on large data collections. Yet, nearest neighbor search is a difficult problem in high dimen...
Arjen P. de Vries, Nikos Mamoulis, Niels Nes, Mart...
ICML
2002
IEEE
14 years 9 months ago
Pruning Improves Heuristic Search for Cost-Sensitive Learning
This paper addresses cost-sensitive classification in the setting where there are costs for measuring each attribute as well as costs for misclassification errors. We show how to ...
Valentina Bayer Zubek, Thomas G. Dietterich