Sciweavers

779 search results - page 63 / 156
» Determining Time of Queries for Re-ranking Search Results
Sort
View
STOC
1998
ACM
190views Algorithms» more  STOC 1998»
13 years 12 months ago
Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...
Eyal Kushilevitz, Rafail Ostrovsky, Yuval Rabani
BIOCOMP
2007
13 years 9 months ago
Quality-Based Similarity Search for Biological Sequence Databases
Low-Complexity Regions (LCRs) of biological sequences are the main source of false positives in similarity searches for biological sequence databases. We consider the problem of ...
Xuehui Li, Tamer Kahveci
BMCBI
2005
169views more  BMCBI 2005»
13 years 7 months ago
MAPPER: a search engine for the computational identification of putative transcription factor binding sites in multiple genomes
Background: Cis-regulatory modules are combinations of regulatory elements occurring in close proximity to each other that control the spatial and temporal expression of genes. Th...
Voichita D. Marinescu, Isaac S. Kohane, Alberto Ri...
WWW
2003
ACM
14 years 8 months ago
Scaling personalized web search
Recent web search techniques augment traditional text matching with a global notion of "importance" based on the linkage structure of the web, such as in Google's P...
Glen Jeh, Jennifer Widom
EDBT
1998
ACM
131views Database» more  EDBT 1998»
13 years 12 months ago
Processing Complex Similarity Queries with Distance-Based Access Methods
Efficient evaluation of similarity queries is one of the basic requirements for advanced multimedia applications. In this paper, we consider the relevant case where complex similar...
Paolo Ciaccia, Marco Patella, Pavel Zezula