Sciweavers

1596 search results - page 82 / 320
» Human-Guided Simple Search
Sort
View
SODA
2000
ACM
132views Algorithms» more  SODA 2000»
15 years 5 months ago
Expected-case complexity of approximate nearest neighbor searching
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
Sunil Arya, Ho-Yam Addy Fu
SPIESR
2000
104views Database» more  SPIESR 2000»
15 years 5 months ago
Feature localization and search by object model under illumination change
Color object recognition methods that are based on image retrieval algorithms can handle changes of illumination via image normalization, e.g. simple color-channel-normalization1 ...
Mark S. Drew, Zinovi Tauber, Ze-Nian Li
BMCBI
2008
75views more  BMCBI 2008»
15 years 4 months ago
Re-searcher: a system for recurrent detection of homologous protein sequences
Background: Sequence searches are routinely employed to detect and annotate related proteins. However, a rapid growth of databases necessitates a frequent repetition of sequence s...
Valdemaras Repsys, Mindaugas Margelevicius, Ceslov...
222
Voted
ICDE
2003
IEEE
107views Database» more  ICDE 2003»
16 years 5 months ago
Managing Data Mappings in the Hyperion Project
We consider the problem of mapping data in peerto-peer systems. Such systems rely on simple value searches to locate data of interest. However, different peers may use different v...
Anastasios Kementsietsidis, Marcelo Arenas, Ren&ea...
SIGIR
2009
ACM
15 years 10 months ago
A comparison of retrieval-based hierarchical clustering approaches to person name disambiguation
This paper describes a simple clustering approach to person name disambiguation of retrieved documents. The methods are based on standard IR concepts and do not require any task-s...
Christof Monz, Wouter Weerkamp