Sciweavers

Share
DAGSTUHL
2004
9 years 2 months ago
On the Complexity of Parabolic Initial Value Problems with Variable Drift
We study the intrinsic difficulty of solving linear parabolic initial value problems numerically at a single point. We present a worst case analysis for deterministic as well as fo...
Knut Petras, Klaus Ritter
NIPS
2007
9 years 2 months ago
Loop Series and Bethe Variational Bounds in Attractive Graphical Models
Variational methods are frequently used to approximate or bound the partition or likelihood function of a Markov random field. Methods based on mean field theory are guaranteed ...
Erik B. Sudderth, Martin J. Wainwright, Alan S. Wi...
NIPS
2007
9 years 2 months ago
New Outer Bounds on the Marginal Polytope
We give a new class of outer bounds on the marginal polytope, and propose a cutting-plane algorithm for efficiently optimizing over these constraints. When combined with a concav...
David Sontag, Tommi Jaakkola
DLT
2007
9 years 2 months ago
State Complexity of Union and Intersection of Finite Languages
Abstract. We investigate the state complexity of union and intersection for finite languages. Note that the problem of obtaining the tight bounds for both operations was open. We ...
Yo-Sub Han, Kai Salomaa
CPAIOR
2008
Springer
9 years 3 months ago
Leveraging Belief Propagation, Backtrack Search, and Statistics for Model Counting
We consider the problem of estimating the model count (number of solutions) of Boolean formulas, and present two techniques that compute estimates of these counts, as well as eith...
Lukas Kroc, Ashish Sabharwal, Bart Selman
ASIACRYPT
2000
Springer
9 years 4 months ago
Provable Security for the Skipjack-like Structure against Differential Cryptanalysis and Linear Cryptanalysis
In this paper we introduce a structure iterated by the rule A of Skipjack and show that this structure is provably resistant against differential or linear attacks. It is the main ...
Jaechul Sung, Sangjin Lee, Jong In Lim, Seokhie Ho...
CRYPTO
2007
Springer
106views Cryptology» more  CRYPTO 2007»
9 years 5 months ago
Indistinguishability Amplification
system is the abstraction of the input-output behavior of any kind of discrete system, in particular cryptographic systems. Many aspects of cryptographic security analyses and pro...
Ueli M. Maurer, Krzysztof Pietrzak, Renato Renner
FOCS
1990
IEEE
9 years 5 months ago
Complexity of Unification in Free Groups and Free Semi-groups
The exponent of periodicity is an important factor in estimates of complexity of word-unification algorithms. We prove that the exponent of periodicity of a minimal solution of a w...
Antoni Koscielski, Leszek Pacholski
SAS
1993
Springer
126views Formal Methods» more  SAS 1993»
9 years 5 months ago
Finiteness Conditions for Strictness Analysis
We give upper bounds on the number of times the fixed point operator needs to be unfolded for strictness analysis of functional languages with lists. This extends previous work b...
Flemming Nielson, Hanne Riis Nielson
DAC
1994
ACM
9 years 5 months ago
Exact Minimum Cycle Times for Finite State Machines
In current research, the minimum cycle times of finite state machines are estimated by computing the delays of the combinational logic in the finite state machines. Even though th...
William K. C. Lam, Robert K. Brayton, Alberto L. S...
books