Sciweavers

276 search results - page 11 / 56
» On Bisectors for Different Distance Functions
Sort
View
BMCBI
2010
117views more  BMCBI 2010»
14 years 11 months ago
New decoding algorithms for Hidden Markov Models using distance measures on labellings
Background: Existing hidden Markov model decoding algorithms do not focus on approximately identifying the sequence feature boundaries. Results: We give a set of algorithms to com...
Daniel G. Brown 0001, Jakub Truszkowski
DAGM
2006
Springer
15 years 3 months ago
Efficient Algorithms for Similarity Measures over Sequential Data: A Look Beyond Kernels
Kernel functions as similarity measures for sequential data have been extensively studied in previous research. This contribution addresses the efficient computation of distance fu...
Konrad Rieck, Pavel Laskov, Klaus-Robert Müll...
ICDE
2012
IEEE
252views Database» more  ICDE 2012»
13 years 2 months ago
Fuzzy Joins Using MapReduce
—Fuzzy/similarity joins have been widely studied in the research community and extensively used in real-world applications. This paper proposes and evaluates several algorithms f...
Foto N. Afrati, Anish Das Sarma, David Menestrina,...
SSD
2009
Springer
149views Database» more  SSD 2009»
15 years 6 months ago
Analyzing Trajectories Using Uncertainty and Background Information
A key issue in clustering data, regardless the algorithm used, is the definition of a distance function. In the case of trajectory data, different distance functions have been pro...
Bart Kuijpers, Bart Moelans, Walied Othman, Alejan...
RANDOM
2001
Springer
15 years 4 months ago
Proclaiming Dictators and Juntas or Testing Boolean Formulae
We consider the problem of determining whether a given function ¢ £ ¤¥ ¦ §¨©  ¤¥ ¦ §¨ belongs to a certain class of Boolean functions  or whether it is far from the...
Michal Parnas, Dana Ron, Alex Samorodnitsky