17760 search results - page 166 / 3552 » A Generalization of the Massey-Ding Algorithm |
124
Voted
BMCBI
2008
15 years 4 months ago
2008
Background: With the advent of high throughput biotechnology data acquisition platforms such as micro arrays, SNP chips and mass spectrometers, data sets with many more variables ...
181
click to vote
CORR
2011
Springer
2011
Springer
On a linear programming approach to the discrete Willmore boundary value problem and generalizations
14 years 11 months ago
We consider the problem of finding (possibly non connected) discrete surfaces spanning a finite set of discrete boundary curves in the three-dimensional space and minimizing (glo...
136
Voted
PAMI
2011
14 years 11 months ago
2011
—In this paper, we introduce a novel method to solve shape alignment problems. We use gray-scale “images” to represent source shapes, and propose a novel two-component Gaussi...
135
click to vote
CVPR
2003
IEEE
16 years 6 months ago
2003
IEEE
This paper presents an algebro-geometric solution to the problem of segmenting an unknown number of subspaces of unknown and varying dimensions from sample data points. We represen...
146
click to vote
KDD
2008
ACM
16 years 4 months ago
2008
ACM
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...