17760 search results - page 111 / 3552 » A Generalization of the Massey-Ding Algorithm |
139
click to vote
ICALP
2011
Springer
14 years 5 months ago
2011
Springer
We consider the following Tree-Constrained Bipartite Matching problem: Given two rooted trees T1 = (V1, E1), T2 = (V2, E2) and a weight function w : V1 × V2 → R+, find a maximu...
109
click to vote
BMCBI
2010
15 years 1 months ago
2010
Background: DNA sequence comparison is a well-studied problem, in which two DNA sequences are compared using a weighted edit distance. Recent DNA sequencing technologies however o...
117
click to vote
VIS
2007
IEEE
16 years 2 months ago
2007
IEEE
We propose a novel, geometrically adaptive method for surface reconstruction from noisy and sparse point clouds, without orientation information. The method employs a fast convecti...
133
click to vote
ICML
2004
IEEE
16 years 2 months ago
2004
IEEE
The problem of computing low rank approximations of matrices is considered. The novel aspect of our approach is that the low rank approximations are on a collection of matrices. W...
126
click to vote
IJSI
2008
15 years 1 months ago
2008
Many data mining applications have a large amount of data but labeling data is often difficult, expensive, or time consuming, as it requires human experts for annotation. Semi-supe...