Sciweavers

1493 search results - page 25 / 299
» Local resilience of graphs
Sort
View
COMPGEOM
2003
ACM
14 years 28 days ago
Local polyhedra and geometric graphs
We introduce a new realistic input model for geometric graphs and nonconvex polyhedra. A geometric graph G is local if (1) the longest edge at every vertex v is only a constant fa...
Jeff Erickson
JMM2
2007
127views more  JMM2 2007»
13 years 7 months ago
Robust Face Recognition through Local Graph Matching
— A novel face recognition method is proposed, in which face images are represented by a set of local labeled graphs, each containing information about the appearance and geometr...
Ehsan Fazl Ersi, John S. Zelek, John K. Tsotsos
CONSTRAINTS
2007
122views more  CONSTRAINTS 2007»
13 years 7 months ago
Stochastic Local Search Algorithms for Graph Set T -colouring and Frequency Assignment
The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...
Marco Chiarandini, Thomas Stützle
ICRA
2010
IEEE
185views Robotics» more  ICRA 2010»
13 years 6 months ago
Graph based distributed control of non-holonomic vehicles endowed with local positioning information engaged in escorting missio
— Using graph theory, this paper investigates how a group of robots, endowed with local positioning (range and bearing from other robots), can be engaged in a leaderfollowing mis...
Riccardo Falconi, Sven Gowal, Alcherio Martinoli
ICMCS
2008
IEEE
165views Multimedia» more  ICMCS 2008»
14 years 2 months ago
Graph cuts by using local texture features of wavelet coefficient for image segmentation
This paper proposes an approach to image segmentation using Iterated Graph Cuts based on local texture features of wavelet coefficient. Using Multiresolution Analysis based on Ha...
Keita Fukuda, Tetsuya Takiguchi, Yasuo Ariki