Sciweavers

62 search results - page 5 / 13
» On Nearest-Neighbor Graphs
Sort
View
GD
2004
Springer
14 years 3 months ago
The Three Dimensional Logic Engine
We consider the following graph embedding question: given a graph G, is it possible to map its vertices to points in 3D such that G is isomorphic to the mutual nearest neighbor gra...
Matthew Kitching, Sue Whitesides
JPDC
2007
138views more  JPDC 2007»
13 years 9 months ago
Distributed computation of the knn graph for large high-dimensional point sets
High-dimensional problems arising from robot motion planning, biology, data mining, and geographic information systems often require the computation of k nearest neighbor (knn) gr...
Erion Plaku, Lydia E. Kavraki
TROB
2008
128views more  TROB 2008»
13 years 9 months ago
Convergence-Preserving Switching for Topology-Dependent Decentralized Systems
Abstract-- Stability analysis of decentralized control mechanisms for networked, coordinating systems has generally focused on specific controller implementations, such as nearest ...
Brian Shucker, Todd D. Murphey, John K. Bennett
ICPR
2002
IEEE
14 years 11 months ago
Metric-Based Shape Retrieval in Large Databases
This paper examines the problem of database organization and retrieval based on computing metric pairwise distances. A low-dimensional Euclidean approximation of a high-dimensiona...
Thomas B. Sebastian, Benjamin B. Kimia
RSFDGRC
2005
Springer
117views Data Mining» more  RSFDGRC 2005»
14 years 3 months ago
Dependency Bagging
In this paper, a new variant of Bagging named DepenBag is proposed. This algorithm obtains bootstrap samples at first. Then, it employs a causal discoverer to induce from each sam...
Yuan Jiang, Jinjiang Ling, Gang Li, Honghua Dai, Z...