Sciweavers

2463 search results - page 356 / 493
» Rankings of Directed Graphs
Sort
View
PERCOM
2004
ACM
14 years 9 months ago
Analyzing Connectivity-Based Multi-Hop Ad-hoc Positioning
We investigate the theoretical limits of positioning algorithms. In particular, we study scenarios where the nodes do not receive anchors directly (multi-hop) and where no physica...
Regina Bischoff, Roger Wattenhofer
STACS
2010
Springer
14 years 4 months ago
On Iterated Dominance, Matrix Elimination, and Matched Paths
We study computational problems that arise in the context of iterated dominance in anonymous games, and show that deciding whether a game can be solved by means of iterated weak d...
Felix Brandt, Felix A. Fischer, Markus Holzer
DATE
2009
IEEE
113views Hardware» more  DATE 2009»
14 years 4 months ago
Exploiting structure in an AIG based QBF solver
—In this paper we present a procedure for solving quantified boolean formulas (QBF), which uses And-Inverter Graphs (AIGs) as the core data-structure. We make extensive use of s...
Florian Pigorsch, Christoph Scholl
ICASSP
2009
IEEE
14 years 4 months ago
A compressive sensing approach to object-based surveillance video coding
This paper studies the feasibility and investigates various choices in the application of compressive sensing (CS) to object-based surveillance video coding. The residual object e...
Divya Venkatraman, Anamitra Makur
TASE
2009
IEEE
14 years 4 months ago
Verifying Self-stabilizing Population Protocols with Coq
Population protocols are an elegant model recently introduced for distributed algorithms running in large and unreliable networks of tiny mobile agents. Correctness proofs of such...
Yuxin Deng, Jean-François Monin