Sciweavers

1154 search results - page 128 / 231
» On the editing distance of graphs
Sort
View
CVPR
2007
IEEE
14 years 4 months ago
Conformal Embedding Analysis with Local Graph Modeling on the Unit Hypersphere
We present the Conformal Embedding Analysis (CEA) for feature extraction and dimensionality reduction. Incorporating both conformal mapping and discriminating analysis, CEA projec...
Yun Fu, Ming Liu, Thomas S. Huang
IMA
2001
Springer
80views Cryptology» more  IMA 2001»
14 years 2 months ago
Spectrally Bounded Sequences, Codes, and States: Graph Constructions and Entanglement
A recursive construction is provided for sequence sets which possess good Hamming Distance and low Peak-to-Average Power Ratio (PAR) under any Local Unitary Unimodular Transform. W...
Matthew G. Parker
IPPS
1999
IEEE
14 years 2 months ago
Sparse Hypercube: A Minimal k-Line Broadcast Graph
This paper proposes a method for reducing the maximum degree of vertices in graphs that maintain optimal broadcast time when a vertex can call a vertex at distance at most k durin...
Satoshi Fujita, Arthur M. Farley
IJRR
2000
94views more  IJRR 2000»
13 years 10 months ago
Sensor-Based Exploration: Incremental Construction of the Hierarchical Generalized Voronoi Graph
This paper prescribes an incremental procedure to construct roadmaps of unknown environments. Recall that a roadmap is a geometric structure that a robot uses to plan a path betwe...
Howie Choset, Sean Walker, Kunnayut Eiamsa-Ard, Jo...
CDC
2010
IEEE
114views Control Systems» more  CDC 2010»
13 years 5 months ago
Sufficient conditions for flocking via graph robustness analysis
In this paper, we consider a multi-agent system consisting of mobile agents with second-order dynamics. The communication network is determined by a standard interaction rule based...
Samuel Martin, Antoine Girard