Sciweavers

2612 search results - page 82 / 523
» Switching Graphs and Their Complexity
Sort
View
COCOA
2008
Springer
13 years 11 months ago
Protean Graphs with a Variety of Ranking Schemes
The World Wide Web may be viewed as a graph each of whose vertices corresponds to a static HTML web page, and each of whose edges corresponds to a hyperlink from one web page to an...
Pawel Pralat
AMC
2005
145views more  AMC 2005»
13 years 10 months ago
Connectivity graphs as models of local interactions
In this paper, we study graphs that arise from certain sensory and communication limitations on the local interactions in multi-agent systems. In particular, we show that the set ...
Abubakr Muhammad, Magnus Egerstedt
GLVLSI
2002
IEEE
160views VLSI» more  GLVLSI 2002»
14 years 3 months ago
Computing walsh, arithmetic, and reed-muller spectral decision diagrams using graph transformations
Spectral techniques have found many applications in computeraided design, including synthesis, verification, and testing. Decision diagram representations permit spectral coeffici...
Whitney J. Townsend, Mitchell A. Thornton, Rolf Dr...
ICRA
2007
IEEE
115views Robotics» more  ICRA 2007»
14 years 4 months ago
Sensor Selection Using Information Complexity for Multi-sensor Mobile Robot Localization
—Our sensor selection algorithm targets the problem of global self-localization of multi-sensor mobile robots. The algorithm builds on the probabilistic reasoning using Bayes fil...
Sreenivas R. Sukumar, Hamparsum Bozdogan, David L....
ESA
2005
Springer
162views Algorithms» more  ESA 2005»
14 years 3 months ago
Minimal Interval Completions
We study the problem of adding edges to an arbitrary graph so that the resulting graph is an interval graph. Our objective is to add an inclusion minimal set of edges, which means ...
Pinar Heggernes, Karol Suchan, Ioan Todinca, Yngve...