Sciweavers

232 search results - page 17 / 47
» Fast High-Dimensional Data Search in Incomplete Databases
Sort
View
BMCBI
2011
14 years 3 months ago
Structator: fast index-based search for RNA sequence-structure patterns
Background: The secondary structure of RNA molecules is intimately related to their function and often more conserved than the sequence. Hence, the important task of searching dat...
Fernando Meyer, Stefan Kurtz, Rolf Backofen, Sebas...
200
Voted
ICDE
2007
IEEE
219views Database» more  ICDE 2007»
16 years 1 months ago
Efficient Keyword Search Across Heterogeneous Relational Databases
Keyword search is a familiar and potentially effective way to find information of interest that is "locked" inside relational databases. Current work has generally assum...
Mayssam Sayyadian, Hieu LeKhac, AnHai Doan, Luis G...
PODS
2005
ACM
127views Database» more  PODS 2005»
15 years 11 months ago
FTW: fast similarity search under the time warping distance
Time-series data naturally arise in countless domains, such as meteorology, astrophysics, geology, multimedia, and economics. Similarity search is very popular, and DTW (Dynamic T...
Yasushi Sakurai, Masatoshi Yoshikawa, Christos Fal...
GCB
2004
Springer
91views Biometrics» more  GCB 2004»
15 years 5 months ago
A Method for Fast Approximate Searching of Polypeptide Structures in the PDB
: The main contribution of this paper is a novel approach for fast searching in huge structural databases like the PDB. The data structure is based on an adaption of the generalize...
Hanjo Täubig, Arno Buchner, Jan Griebsch
CVPR
2010
IEEE
15 years 7 months ago
SPEC Hashing: Similarity Preserving algorithm for Entropy-based Coding
Searching approximate nearest neighbors in large scale high dimensional data set has been a challenging problem. This paper presents a novel and fast algorithm for learning binary...
Ruei-Sung Lin, David Ross, Jay Yagnik