Sciweavers

1664 search results - page 132 / 333
» Distance labeling in graphs
Sort
View
IJCGA
2010
78views more  IJCGA 2010»
15 years 1 months ago
Operations Preserving Global Rigidity of Generic Direction-Length Frameworks
A two-dimensional direction-length framework is a pair (G, p), where G = (V ; D, L) is a graph whose edges are labeled as `direction' or `length' edges, and a map p from...
Bill Jackson, Tibor Jordán
167
Voted
SDM
2008
SIAM
144views Data Mining» more  SDM 2008»
15 years 6 months ago
Semi-supervised Multi-label Learning by Solving a Sylvester Equation
Multi-label learning refers to the problems where an instance can be assigned to more than one category. In this paper, we present a novel Semi-supervised algorithm for Multi-labe...
Gang Chen, Yangqiu Song, Fei Wang, Changshui Zhang
TMI
2008
144views more  TMI 2008»
15 years 4 months ago
Automatic Detection of Regional Heart Rejection in USPIO-Enhanced MRI
Contrast-enhanced magnetic resonance imaging (MRI) is useful to study the infiltration of cells in vivo. This research adopts ultrasmall superparamagnetic iron oxide (USPIO) parti...
Hsun-Hsien Chang, José M. F. Moura, Yijen L...
TIP
2010
155views more  TIP 2010»
15 years 2 months ago
Laplacian Regularized D-Optimal Design for Active Learning and Its Application to Image Retrieval
—In increasingly many cases of interest in computer vision and pattern recognition, one is often confronted with the situation where data size is very large. Usually, the labels ...
Xiaofei He
ISAAC
2000
Springer
110views Algorithms» more  ISAAC 2000»
15 years 8 months ago
Online Routing in Convex Subdivisions
We consider online routing algorithms for finding paths between the vertices of plane graphs. We show (1) there exists a routing algorithm for arbitrary triangulations that has no...
Prosenjit Bose, Pat Morin, Andrej Brodnik, Svante ...