Sciweavers

307 search results - page 13 / 62
» On Equations over Sets of Integers
Sort
View
ACL
2010
13 years 5 months ago
Global Learning of Focused Entailment Graphs
We propose a global algorithm for learning entailment relations between predicates. We define a graph structure over predicates that represents entailment relations as directed ed...
Jonathan Berant, Ido Dagan, Jacob Goldberger
ICIP
2001
IEEE
14 years 9 months ago
A comparative evaluation of algorithms for fast computation of level set PDEs with applications to motion segmentation
We address the problem of fast computation of level set partial differential equations (PDEs) in the context of motion segmentation. Although several fast level set computation al...
Abdol-Reza Mansouri, Thierry Chomaud, Janusz Konra...
GLOBECOM
2006
IEEE
14 years 1 months ago
When Does One Redundant Parity-Check Equation Matter?
— We analyze the effect of redundant parity-check equations on the error-floor performance of low-density paritycheck (LDPC) codes used over the additive white Gaussian noise (A...
Stefan Laendner, Thorsten Hehn, Olgica Milenkovic,...
LPAR
2010
Springer
13 years 5 months ago
Interpolating Quantifier-Free Presburger Arithmetic
Craig interpolation has become a key ingredient in many symbolic model checkers, serving as an approximative replacement for expensive quantifier elimination. In this paper, we foc...
Daniel Kroening, Jérôme Leroux, Phili...
RSA
2010
104views more  RSA 2010»
13 years 5 months ago
Random graphs with forbidden vertex degrees
We study the random graph Gn,λ/n conditioned on the event that all vertex degrees lie in some given subset S of the nonnegative integers. Subject to a certain hypothesis on S, the...
Geoffrey R. Grimmett, Svante Janson