Sciweavers

1100 search results - page 162 / 220
» Approximate distance oracles
Sort
View
FSTTCS
2003
Springer
15 years 3 months ago
Comparing Sequences with Segment Rearrangements
Computational genomics involves comparing sequences based on “similarity” for detecting evolutionary and functional relationships. Until very recently, available portions of th...
Funda Ergün, S. Muthukrishnan, Süleyman ...
ECCV
2010
Springer
15 years 3 months ago
The Generalized PatchMatch Correspondence Algorithm
Abstract. PatchMatch is a fast algorithm for computing dense approximate nearest neighbor correspondences between patches of two image regions [1]. This paper generalizes PatchMatc...
CDC
2009
IEEE
147views Control Systems» more  CDC 2009»
15 years 2 months ago
A simulation-based method for aggregating Markov chains
— This paper addresses model reduction for a Markov chain on a large state space. A simulation-based framework is introduced to perform state aggregation of the Markov chain base...
Kun Deng, Prashant G. Mehta, Sean P. Meyn
COLT
1999
Springer
15 years 2 months ago
Boosting as Entropy Projection
We consider the AdaBoost procedure for boosting weak learners. In AdaBoost, a key step is choosing a new distribution on the training examples based on the old distribution and th...
Jyrki Kivinen, Manfred K. Warmuth
SSDBM
1999
IEEE
124views Database» more  SSDBM 1999»
15 years 2 months ago
An Indexing Scheme for Fast Similarity Search in Large Time Series Databases
We address the problem of similarity search in large time series databases. We introduce a novel indexing algorithm that allows faster retrieval. The index is formed by creating b...
Eamonn J. Keogh, Michael J. Pazzani