146 search results - page 13 / 30 » On the Structure of Sequential Search: Beyond |
SIGMOD
2002
ACM
14 years 7 months ago
2002
ACM
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...
CIKM
2005
Springer
14 years 27 days ago
2005
Springer
We study suitable indexing techniques to support efficient exact match search in large biological sequence databases. We propose a suffix tree (ST) representation, called STA-DF, ...
CHI
2000
ACM
13 years 11 months ago
2000
ACM
We developed a user interface that organizes Web search results into hierarchical categories. Text classification algorithms were used to automatically classify arbitrary search r...
ICCS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. The Evolutionary Geometric Near-neighbor Access Tree (EGNAT) is a recently proposed data structure that is suitable for indexing large collections of complex objects. It ...
CP
2006
Springer
13 years 11 months ago
2006
Springer
Distributed computing is increasingly important at a time when the doubling of the number of transistors on a processor every 18 months no longer translates in a doubling of speed ...