Sciweavers

1208 search results - page 79 / 242
» On Counting Generalized Colorings
Sort
View
COCO
2007
Springer
87views Algorithms» more  COCO 2007»
14 years 3 months ago
Parity Problems in Planar Graphs
We consider the problem of counting the number of spanning trees in planar graphs. We prove tight bounds on the complexity of the problem, both in general and especially in the mo...
Mark Braverman, Raghav Kulkarni, Sambuddha Roy
DCC
2010
IEEE
13 years 9 months ago
Practical unconditionally secure two-channel message authentication
We investigate unconditional security for message authentication protocols that are designed using two-channel cryptography. We look at both noninteractive message authentication ...
Atefeh Mashatan, Douglas R. Stinson
CP
2010
Springer
13 years 7 months ago
Computing the Density of States of Boolean Formulas
Abstract. In this paper we consider the problem of computing the density of states of a Boolean formula in CNF, a generalization of both MAX-SAT and model counting. Given a Boolean...
Stefano Ermon, Carla P. Gomes, Bart Selman
DAC
2011
ACM
12 years 9 months ago
Full-chip TSV-to-TSV coupling analysis and optimization in 3D IC
This paper studies TSV-to-TSV coupling in 3D ICs. A full-chip SI analysis flow is proposed based on the proposed coupling model. Analysis results show that TSVs cause significan...
Chang Liu, Taigon Song, Jonghyun Cho, Joohee Kim, ...
DIAGRAMS
2004
Springer
14 years 2 months ago
Bayesian Boxes: A Colored Calculator for Picturing Posteriors
The need for Bayesian inference arises in military intelligence, medical diagnosis and many other practical applications. The problem is that human inferences are generally conserv...
Kevin Burns