Sciweavers

1671 search results - page 217 / 335
» Hierarchical graph maps
Sort
View
ACISP
1998
Springer
14 years 2 months ago
Detecting Key-Dependencies
The confidentiality of encrypted data depends on how well the key under which it was encrypted is maintained. If a session key was exchanged encrypted under a long-term key, exposu...
Tage Stabell-Kulø, Arne Helme, Gianluca Din...
ICCAD
1993
IEEE
81views Hardware» more  ICCAD 1993»
14 years 2 months ago
Inverter minimization in multi-level logic networks
In this paper, we look at the problem of inverter minimization in multi-level logic networks. The network is specified in terms of a set of base functions and the inversion opera...
Alok Jain, Randal E. Bryant
COCOON
2006
Springer
14 years 1 months ago
Finding Small OBDDs for Incompletely Specified Truth Tables Is Hard
We present an efficient reduction mapping undirected graphs G with n = 2k vertices for integers k to tables of partially specified Boolean functions g : {0, 1}4k+1 {0, 1, } so tha...
Jesper Torp Kristensen, Peter Bro Miltersen
SODA
2007
ACM
76views Algorithms» more  SODA 2007»
13 years 11 months ago
An unbiased pointing operator for unlabeled structures, with applications to counting and sampling
We introduce a general method to count and randomly sample unlabeled combinatorial structures. The approach is based on pointing unlabeled structures in an “unbiased” way, i.e...
Manuel Bodirsky, Éric Fusy, Mihyun Kang, St...
UAI
2004
13 years 11 months ago
On Finding Minimal w-cutset
The complexity of a reasoning task over a graphical model is tied to the induced width of the underlying graph. It is well-known that the conditioning (assigning values) on a subs...
Bozhena Bidyuk, Rina Dechter