Sciweavers

2314 search results - page 109 / 463
» Minimal Partitions of a Graph
Sort
View
138
Voted
CVPR
2009
IEEE
15 years 10 months ago
Automatic facial landmark labeling with minimal supervision
Landmark labeling of training images is essential for many learning tasks in computer vision, such as object detection, tracking, and alignment. Image labeling is typically conduc...
Yan Tong, Xiaoming Liu 0002, Frederick W. Wheeler,...
129
Voted
ICRA
2007
IEEE
149views Robotics» more  ICRA 2007»
15 years 10 months ago
Model-based Motion Estimation of Elastic Surfaces for Minimally Invasive Cardiac Surgery
— In order to assist surgeons during surgery on moving organs, e.g. minimally invasive beating heart bypass surgery, a master-slave system which synchronizes surgical instruments...
Thomas Bader, Alexander Wiedemann, Kathrin Roberts...
142
Voted
BMCBI
2004
181views more  BMCBI 2004»
15 years 3 months ago
Iterative class discovery and feature selection using Minimal Spanning Trees
Background: Clustering is one of the most commonly used methods for discovering hidden structure in microarray gene expression data. Most current methods for clustering samples ar...
Sudhir Varma, Richard Simon
141
Voted
COMBINATORICS
2006
124views more  COMBINATORICS 2006»
15 years 3 months ago
Bounded-Degree Graphs have Arbitrarily Large Geometric Thickness
Abstract. The geometric thickness of a graph G is the minimum integer k such that there is a straight line drawing of G with its edge set partitioned into k plane subgraphs. Eppste...
János Barát, Jirí Matousek, D...
148
Voted
PAMI
2008
195views more  PAMI 2008»
15 years 3 months ago
Path Similarity Skeleton Graph Matching
This paper proposes a novel graph matching algorithm and applies it to shape recognition based on object silhouettes. The main idea is to match skeleton graphs by comparing the geo...
Xiang Bai, Longin Jan Latecki