167 search results - page 7 / 34 » On the complexity and approximation of syntenic distance |
ICDE
2009
IEEE
14 years 9 months ago
2009
IEEE
Abstract-- Particle simulation has become an important research tool in many scientific and engineering fields. Data generated by such simulations impose great challenges to databa...
EMMCVPR
2005
Springer
14 years 1 months ago
2005
Springer
This paper addresses the problem of efficient information theoretic, non-parametric data clustering. We develop a procedure for adapting the cluster memberships of the data pattern...
ISAAC
2003
Springer
14 years 22 days ago
2003
Springer
Given a string x and a language L, the Hamming distance of x to L is the minimum Hamming distance of x to any string in L. The edit distance of a string to a language is analogous...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
FSTTCS
1993
Springer
13 years 11 months ago
1993
Springer
We investigate the complexity and approximability of some location problems when two distance values are specified for each pair of potential sites. These problems involve the se...