Sciweavers

905 search results - page 7 / 181
» On the Complexity of uSPR Distance
Sort
View
COCOON
2005
Springer
14 years 26 days ago
Conserved Interval Distance Computation Between Non-trivial Genomes
Recently, several studies taking into account the ability for a gene to be absent or to have some copies in genomes have been proposed, as the examplar distance [11, 6] or the gene...
Guillaume Blin, Romeo Rizzi
STOC
2005
ACM
113views Algorithms» more  STOC 2005»
14 years 7 months ago
Efficient testing of groups
We construct an efficient probabilistic algorithm that, given a finite set with a binary operation, tests if it is an abelian group. The distance used is an analogue of the edit d...
Katalin Friedl, Gábor Ivanyos, Miklos Santh...
ICIP
2005
IEEE
14 years 9 months ago
An effective human iris code with low complexity
A human iris coding technique is reported based upon differences in the power spectrum of fragments from normalized iris images. The procedure has been applied to a set of 2174 im...
Donald M. Monro, Dexin Zhang
ALGOSENSORS
2004
Springer
14 years 22 days ago
On the Computational Complexity of Sensor Network Localization
Determining the positions of the sensor nodes in a network is essential to many network functionalities such as routing, coverage and tracking, and event detection. The localizatio...
James Aspnes, David Kiyoshi Goldenberg, Yang Richa...
ISAAC
2003
Springer
133views Algorithms» more  ISAAC 2003»
14 years 16 days ago
The Intractability of Computing the Hamming Distance
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...
Bodo Manthey, Rüdiger Reischuk