28 search results - page 3 / 6 » Finding Time-Lagged 3D Clusters |
ICCV
2007
IEEE
15 years 11 months ago
2007
IEEE
In this paper we propose a general framework to solve the articulated shape matching problem, formulated as finding point-to-point correspondences between two shapes represented b...
89
Voted
SIAMSC
2008
14 years 9 months ago
2008
We propose a distributed algorithm for solving Euclidean metric realization problems arising from large 3D graphs, using only noisy distance information, and without any prior kno...
87
Voted
IPPS
1996
IEEE
15 years 1 months ago
1996
IEEE
A common statistical problem is that of nding the median element in a set of data. This paper presents a fastand portable parallel algorithm for nding the median given a set of el...
ISBI
2008
IEEE
15 years 10 months ago
2008
IEEE
The cortical folding patterns are very different from one individual to another. Here we try to find folding patterns automatically using large-scale datasets by non-supervised cl...
70
Voted
ECCV
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. We consider the problem of clustering data into k 2 clusters given complex relations -- going beyond pairwise -- between the data points. The complex n-wise relations ar...