Sciweavers

1664 search results - page 64 / 333
» Distance labeling in graphs
Sort
View
IGARSS
2009
14 years 9 months ago
Active Learning of Hyperspectral Data with Spatially Dependent Label Acquisition Costs
Supervised learners can be used to automatically classify many types of spatially distributed data. For example, land cover classification by hyperspectral image data analysis is ...
Alexander Liu, Goo Jun, Joydeep Ghosh
COMBINATORICS
2004
84views more  COMBINATORICS 2004»
14 years 11 months ago
Planar Maps as Labeled Mobiles
We extend Schaeffer's bijection between rooted quadrangulations and welllabeled trees to the general case of Eulerian planar maps with prescribed face valences to obtain a bi...
J. Bouttier, P. Di Francesco, E. Guitter
SIAMCOMP
2000
125views more  SIAMCOMP 2000»
14 years 11 months ago
Approximating the Stretch Factor of Euclidean Graphs
There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in Rd. t-spanners are Euclidean graphs in whic...
Giri Narasimhan, Michiel H. M. Smid
ACCV
1998
Springer
15 years 4 months ago
Object Recognition by Matching Symbolic Edge Graphs
We present an object recognition system based on symbolic graphs with object corners as vertices and outlines as edges. Corners are determined in a robust way by a multiscale combi...
Tino Lourens, Rolf P. Würtz
NIPS
2004
15 years 1 months ago
Semi-supervised Learning on Directed Graphs
Given a directed graph in which some of the nodes are labeled, we investigate the question of how to exploit the link structure of the graph to infer the labels of the remaining u...
Dengyong Zhou, Bernhard Schölkopf, Thomas Hof...