2489 search results - page 63 / 498 » On the Subgroup Distance Problem |
152
Voted
JMIV
2000
15 years 3 months ago
2000
Auto-calibration is the recovery of the full camera geometry and Euclidean scene structure from several images of an unknown 3D scene, using rigidity constraints and partial knowl...
149
Voted
RECOMB
2006
Springer
16 years 4 months ago
2006
Springer
Abstract. Preliminary to most comparative genomics studies is the annotation of chromosomes as ordered sequences of genes. Unfortunately, different genetic mapping techniques usual...
133
Voted
ICALP
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. The edit distance between two ordered rooted trees with vertex labels is the minimum cost of transforming one tree into the other by a sequence of elementary operations c...
130
Voted
ICIAP
1999
ACM
15 years 8 months ago
1999
ACM
ÐThis paper describes a novel framework for comparing and matching corrupted relational graphs. The paper develops the idea of edit-distance originally introduced for graph-matchi...
121
Voted
TCS
2008
15 years 3 months ago
2008
Abstract. Many graph problems seem to require knowledge that extends beyond the immediate neighbors of a node. The usual self-stabilizing model only allows for nodes to make decisi...