421 search results - page 33 / 85 » String Distances and Uniformities |
127
click to vote
IEEECIT
2005
IEEE
15 years 10 months ago
2005
IEEE
Similarity search leveraging distance-based index structures is increasingly being used for complex data types. It has been shown that for high dimensional uniform vectors with si...
160
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
—We consider the problem of positioning a cloud of points in the Euclidean space Rd , from noisy measurements of a subset of pairwise distances. This task has applications in var...
116
click to vote
ICASSP
2008
IEEE
15 years 10 months ago
2008
IEEE
We address the problem of similarity metric selection in pairwise affinity clustering. Traditional techniques employ standard algebraic context-independent sample-distance measur...
126
click to vote
ALT
2002
Springer
16 years 1 months ago
2002
Springer
Abstract. We consider a problem that is related to the “Universal Encoding Problem” from information theory. The basic goal is to find rules that map “partial information”...
115
click to vote
ECCC
2010
15 years 4 months ago
2010
We give new pseudorandom generators for regular read-once branching programs of small width. A branching program is regular if the in-degree of every vertex in it is either 0 or 2...