Sciweavers

104 search results - page 1 / 21
» An Improved Random Neighborhood Graph Approach
Sort
View
ICRA
2002
IEEE
106views Robotics» more  ICRA 2002»
13 years 10 months ago
An Improved Random Neighborhood Graph Approach
As a general framework to determine a collision-free feedback motion strategies, the Random Neighborhood Graph (RNG) approach [19] defines a global navigation function over an ap...
Libo Yang, Steven M. LaValle
CORR
2006
Springer
151views Education» more  CORR 2006»
13 years 5 months ago
Graph Laplacians and their convergence on random neighborhood graphs
Given a sample from a probability measure with support on a submanifold in Euclidean space one can construct a neighborhood graph which can be seen as an approximation of the subm...
Matthias Hein, Jean-Yves Audibert, Ulrike von Luxb...
ICDM
2010
IEEE
230views Data Mining» more  ICDM 2010»
13 years 3 months ago
Clustering Large Attributed Graphs: An Efficient Incremental Approach
In recent years, many networks have become available for analysis, including social networks, sensor networks, biological networks, etc. Graph clustering has shown its effectivenes...
Yang Zhou, Hong Cheng, Jeffrey Xu Yu
CVPR
2012
IEEE
11 years 7 months ago
Scalable k-NN graph construction for visual descriptors
The k-NN graph has played a central role in increasingly popular data-driven techniques for various learning and vision tasks; yet, finding an efficient and effective way to con...
Jing Wang, Jingdong Wang, Gang Zeng, Zhuowen Tu, R...
IDA
2010
Springer
13 years 6 months ago
A Framework for Path-Oriented Network Simplification
Abstract. We propose a generic framework and methods for simplification of large networks. The methods can be used to improve the understandability of a given network, to complemen...
Hannu Toivonen, Sébastien Mahler, Fang Zhou