Sciweavers

458 search results - page 30 / 92
» Distance graphs: from random geometric graphs to Bernoulli g...
Sort
View
ISNN
2005
Springer
14 years 2 months ago
Advanced Visualization Techniques for Self-organizing Maps with Graph-Based Methods
The Self-Organizing Map is a popular neural network model for data analysis, for which a wide variety of visualization techniques exists. We present a novel technique that takes th...
Georg Pölzlbauer, Andreas Rauber, Michael Dit...
TMM
2010
249views Management» more  TMM 2010»
13 years 3 months ago
Bridging the Semantic Gap Between Image Contents and Tags
With the exponential growth of Web 2.0 applications, tags have been used extensively to describe the image contents on the Web. Due to the noisy and sparse nature in the human gene...
Hao Ma, Jianke Zhu, Michael R. Lyu, Irwin King
WADS
1993
Springer
163views Algorithms» more  WADS 1993»
14 years 24 days ago
Minimum Weight Euclidean Matching and Weighted Relative Neighborhood Graphs
The Minimum Weight Euclidean Matching (MWEM) problem is: given 2n point sites in the plane with Euclidean metric for interpoint distances, match the sites into n pairs so that the...
Andy Mirzaian
ICCV
2005
IEEE
14 years 2 months ago
Robust Point Matching for Two-Dimensional Nonrigid Shapes
Recently, nonrigid shape matching has received more and more attention. For nonrigid shapes, most neighboring points cannot move independently under deformation due to physical co...
Yefeng Zheng, David S. Doermann
SPAA
2005
ACM
14 years 2 months ago
Oblivious routing on geometric networks
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
Costas Busch, Malik Magdon-Ismail, Jing Xi