1214 search results - page 37 / 243 » Labeling Points with Weights |
162
click to vote
PODC
2006
ACM
16 years 4 days ago
2006
ACM
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removi...
171
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...
175
click to vote
ISBI
2002
IEEE
15 years 11 months ago
2002
IEEE
White matter lesions are common brain abnormalities. In this paper, an automatic method for segmentation of white matter lesions in T1-weighted brain magnetic resonance (MR) image...
176
click to vote
PAMI
2006
15 years 6 months ago
2006
This paper describes a novel solution to the rigid point pattern matching problem in Euclidean spaces of any dimension. Although we assume rigid motion, jitter is allowed. We pres...
198
click to vote
CG
2004
Springer
15 years 6 months ago
2004
Springer
We present a new definition of an implicit surface over a noisy point cloud, based on the weighted least squares approach. It can be evaluated very fast, but artifacts are signifi...