2430 search results - page 231 / 486 » Computing Tutte Polynomials |
131
click to vote
GC
2007
Springer
15 years 4 months ago
2007
Springer
The pre-coloring extension problem consists, given a graph G and a set of nodes to which some colors are already assigned, in finding a coloring of G with the minimum number of co...
168
click to vote
PAMI
2008
15 years 4 months ago
2008
We propose a geometric approach to 3D motion segmentation from point correspondences in three perspective views. We demonstrate that after applying a polynomial embedding to the po...
119
click to vote
JCB
2007
15 years 4 months ago
2007
In this paper, we study the problem of computing the similarity of two protein structures ring their contact-map overlap. Contact-map overlap abstracts the problem of computing th...
144
click to vote
RECOMB
2010
Springer
15 years 2 months ago
2010
Springer
Motivated by the trend of genome sequencing without completing the sequence of the whole genomes, Mu˜noz et al. recently studied the problem of filling an incomplete multichromos...
183
click to vote
CVPR
2011
IEEE
14 years 11 months ago
2011
IEEE
We consider the problem of fitting one or more subspaces to a collection of data points drawn from the subspaces and corrupted by noise/outliers. We pose this problem as a rank m...