Sciweavers

712 search results - page 127 / 143
» On Spectral Graph Drawing
Sort
View
CVPR
2010
IEEE
14 years 6 months ago
3D Shape Correspondence by Isometry-Driven Greedy Optimization
We present an automatic method that establishes 3D correspondence between isometric shapes. Our goal is to find an optimal correspondence between two given (nearly) isometric sha...
Yusuf Sahillioglu, Yucel Yemez
ICDM
2009
IEEE
112views Data Mining» more  ICDM 2009»
14 years 4 months ago
Resolving Identity Uncertainty with Learned Random Walks
A pervasive problem in large relational databases is identity uncertainty which occurs when multiple entries in a database refer to the same underlying entity in the world. Relati...
Ted Sandler, Lyle H. Ungar, Koby Crammer
EMMCVPR
2009
Springer
14 years 4 months ago
Robust Segmentation by Cutting across a Stack of Gamma Transformed Images
7th International Conference on Energy Minimization Methods in Computer Vision and Pattern Recognition, Bonn, Germany, August 24-27, 2009 Medical image segmentation appears to be ...
Elena Bernardis, Stella X. Yu
DAGM
2007
Springer
14 years 4 months ago
Semi-supervised Tumor Detection in Magnetic Resonance Spectroscopic Images Using Discriminative Random Fields
Magnetic resonance spectral images provide information on metabolic processes and can thus be used for in vivo tumor diagnosis. However, each single spectrum has to be checked manu...
L. Görlitz, Bjoern H. Menze, M.-A. Weber, B. ...
DAGM
2004
Springer
14 years 3 months ago
Learning from Labeled and Unlabeled Data Using Random Walks
We consider the general problem of learning from labeled and unlabeled data. Given a set of points, some of them are labeled, and the remaining points are unlabeled. The goal is to...
Dengyong Zhou, Bernhard Schölkopf