Sciweavers

4106 search results - page 291 / 822
» A Computational Model for Metric Spaces
Sort
View
CPM
2004
Springer
86views Combinatorics» more  CPM 2004»
15 years 10 months ago
Two Algorithms for LCS Consecutive Suffix Alignment
The problem of comparing two sequences A and B to determine their similarity is one of the fundamental problems in pattern matching. A challenging, basic variation of the sequence...
Gad M. Landau, Eugene W. Myers, Michal Ziv-Ukelson
PAMI
2008
208views more  PAMI 2008»
15 years 6 months ago
BoostMap: An Embedding Method for Efficient Nearest Neighbor Retrieval
This paper describes BoostMap, a method for efficient nearest neighbor retrieval under computationally expensive distance measures. Database and query objects are embedded into a v...
Vassilis Athitsos, Jonathan Alon, Stan Sclaroff, G...
ICDE
2002
IEEE
143views Database» more  ICDE 2002»
16 years 8 months ago
Discovering Similar Multidimensional Trajectories
We investigate techniques for analysis and retrieval of object trajectories in a two or three dimensional space. Such kind of data usually contain a great amount of noise, that ma...
Michail Vlachos, Dimitrios Gunopulos, George Kolli...
CSB
2005
IEEE
205views Bioinformatics» more  CSB 2005»
16 years 10 days ago
Fractal Clustering for Microarray Data Analysis
DNA microarray experiments generate a substantial amount of information about global gene expression. Gene expression profiles can be represented as points in multi-dimensional sp...
Lu-Yong Wang, Ammaiappan Balasubramanian, Amit Cha...
SCCC
2003
IEEE
15 years 12 months ago
Improved Deletions in Dynamic Spatial Approximation Trees
The Dynamic Spatial Approximation Tree (dsa–tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alte...
Gonzalo Navarro, Nora Reyes