Sciweavers

574 search results - page 50 / 115
» Beyond Search: Content Applications
Sort
View
SIGMOD
2009
ACM
235views Database» more  SIGMOD 2009»
16 years 5 months ago
Quality and efficiency in high dimensional nearest neighbor search
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...
Yufei Tao, Ke Yi, Cheng Sheng, Panos Kalnis
SISAP
2010
IEEE
135views Data Mining» more  SISAP 2010»
15 years 3 months ago
Improving the similarity search of tandem mass spectra using metric access methods
In biological applications, the tandem mass spectrometry is a widely used method for determining protein and peptide sequences from an ”in vitro” sample. The sequences are not...
Jiri Novák, Tomás Skopal, David Hoks...
PETRA
2009
ACM
15 years 11 months ago
Towards faster activity search using embedding-based subsequence matching
Event search is the problem of identifying events or activity of interest in a large database storing long sequences of activity. In this paper, our topic is the problem of identi...
Panagiotis Papapetrou, Paul Doliotis, Vassilis Ath...
CLUSTER
2003
IEEE
15 years 10 months ago
A Case Study of Parallel I/O for Biological Sequence Search on Linux Clusters
In this paper we analyze the I/O access patterns of a widely-used biological sequence search tool and implement two variations that employ parallel-I/O for data access based on PV...
Yifeng Zhu, Hong Jiang, Xiao Qin, David R. Swanson
PPOPP
2012
ACM
14 years 21 days ago
A speculation-friendly binary search tree
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...
Tyler Crain, Vincent Gramoli, Michel Raynal