Sciweavers

268 search results - page 7 / 54
» Growing Protean Graphs
Sort
View
LICS
2007
IEEE
15 years 8 months ago
Locally Excluding a Minor
We introduce the concept of locally excluded minors. Graph classes locally excluding a minor are a common generalisation of the concept of excluded minor classes and of graph clas...
Anuj Dawar, Martin Grohe, Stephan Kreutzer
133
Voted
CORR
2012
Springer
230views Education» more  CORR 2012»
13 years 9 months ago
Fast Triangle Counting through Wedge Sampling
Graphs and networks are used to model interactions in a variety of contexts, and there is a growing need to be able to quickly assess the qualities of a graph in order to understa...
C. Seshadhri, Ali Pinar, Tamara G. Kolda
IROS
2009
IEEE
147views Robotics» more  IROS 2009»
15 years 8 months ago
A multi-hypothesis topological SLAM approach for loop closing on edge-ordered graphs
— We present a method for topological SLAM that specifically targets loop closing for edge-ordered graphs. Instead of using a heuristic approach to accept or reject loop closing...
Stephen Tully, George Kantor, Howie Choset, Felix ...
OTM
2007
Springer
15 years 8 months ago
Self-healing in Binomial Graph Networks
The number of processors embedded in high performance computing platforms is growing daily to solve larger and more complex problems. However, as the number of components increases...
Thara Angskun, George Bosilca, Jack Dongarra
120
Voted
ICCAD
2000
IEEE
149views Hardware» more  ICCAD 2000»
15 years 6 months ago
Dynamic Response Time Optimization for SDF Graphs
Synchronous Data Flow (SDF) is a well-known model of computation that is widely used in the control engineering and digital signal processing domains. Existing scheduling methods ...
Dirk Ziegenbein, Jan Uerpmann, Ralph Ernst