Sciweavers

331 search results - page 46 / 67
» Fast Matching for All Pairs Similarity Search
Sort
View
VLDB
1998
ACM
120views Database» more  VLDB 1998»
15 years 1 months ago
Algorithms for Querying by Spatial Structure
: Structural queries constitute a special form of content-basedretrieval where the user specifiesa set of spatial constraints among query variables and asks for all configurations ...
Dimitris Papadias, Nikos Mamoulis, Vasilis Delis
HICSS
2010
IEEE
200views Biometrics» more  HICSS 2010»
14 years 11 months ago
Instability of Relevance-Ranked Results Using Latent Semantic Indexing for Web Search
1 The latent semantic indexing (LSI) methodology for information retrieval applies the singular value decomposition to identify an eigensystem for a large matrix, in which cells re...
Houssain Kettani, Gregory B. Newby
NAR
2008
103views more  NAR 2008»
14 years 9 months ago
DBD--taxonomically broad transcription factor predictions: new content and functionality
DNA-binding domain (DBD) is a database of predicted sequence-specific DNA-binding transcription factors (TFs) for all publicly available proteomes. The proteomes have increased fr...
Derek Wilson, Varodom Charoensawan, Sarah K. Kumme...
WWW
2009
ACM
15 years 10 months ago
Social search in "Small-World" experiments
The "algorithmic small-world hypothesis" states that not only are pairs of individuals in a large social network connected by short paths, but that ordinary individuals ...
Sharad Goel, Roby Muhamad, Duncan J. Watts
CORR
2010
Springer
249views Education» more  CORR 2010»
14 years 9 months ago
Lower Bounds on Near Neighbor Search via Metric Expansion
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
Rina Panigrahy, Kunal Talwar, Udi Wieder