36 search results - page 6 / 8 » Exponential Time Complexity of Weighted Counting of Independ... |
127
click to vote
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
DSD
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract—Verification of application requirements is becoming a bottleneck in system-on-chip design, as the number of applications grows. Traditionally, the verification comple...
114
click to vote
TMI
2011
14 years 5 months ago
2011
Abstract—Many practical applications require the reconstruction of images from irregularly sampled data. The spline formalism offers an attractive framework for solving this prob...
APLAS
2007
ACM
15 years 2 months ago
2007
ACM
Abstract. Given the combinatorial nature of cellular signalling pathways, where biological agents can bind and modify each other in a large number of ways, concurrent or agent-base...
PODC
2010
ACM
15 years 2 months ago
2010
ACM
We introduce Multi-Trials, a new technique for symmetry breaking for distributed algorithms and apply it to various problems in general graphs. For instance, we present three rand...