Sciweavers

1272 search results - page 36 / 255
» Approximate Parameterized Matching
Sort
View
BMCBI
2006
141views more  BMCBI 2006»
14 years 11 months ago
Asymptotic behaviour and optimal word size for exact and approximate word matches between random sequences
Background: The number of k-words shared between two sequences is a simple and effcient alignment-free sequence comparison method. This statistic, D2, has been used for the cluste...
Sylvain Forêt, Miriam R. Kantorovitz, Conrad...
FOCS
2008
IEEE
15 years 5 months ago
A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
Rina Panigrahy, Kunal Talwar, Udi Wieder
ALGORITHMICA
2005
195views more  ALGORITHMICA 2005»
14 years 11 months ago
Bit-Parallel Witnesses and Their Applications to Approximate String Matching
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
Heikki Hyyrö, Gonzalo Navarro
ECCV
2004
Springer
15 years 2 months ago
Approximate Confidence Intervals for Estimation of Matching Error Rates of Biometric Identification Devices
Abstract. Assessing the matching error rates of a biometric identification devices is integral to understanding its performance. Here we propose and evaluate several methods for cr...
Travis J. Atkinson, Michael E. Schuckers
WWW
2008
ACM
15 years 11 months ago
Offline matching approximation algorithms in exchange markets
Motivated by several marketplace applications on rapidly growing online social networks, we study the problem of efficient offline matching algorithms for online exchange markets....
Zeinab Abbassi, Laks V. S. Lakshmanan