1736 search results - page 237 / 348 » The rank-width of Directed Graphs |
141
click to vote
ICSE
2007
IEEE-ACM
16 years 6 months ago
2007
IEEE-ACM
We introduce SoftGUESS, a code clone exploration system. SoftGUESS is built on the more general GUESS system which provides users with a mechanism to interactively explore graph s...
179
click to vote
PERCOM
2004
ACM
16 years 6 months ago
2004
ACM
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...
183
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
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...
166
click to vote
DATE
2009
IEEE
16 years 1 months ago
2009
IEEE
—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...
164
click to vote
ICASSP
2009
IEEE
16 years 1 months ago
2009
IEEE
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...