Sciweavers

8094 search results - page 335 / 1619
» Improvements in Formula Generalization
Sort
View
ESOP
2000
Springer
15 years 9 months ago
Compile-Time Debugging of C Programs Working on Trees
We exhibit a technique for automatically verifying the safety of simple C programs working on tree-shaped data structures. We do not consider the complete behavior of programs, but...
Jacob Elgaard, Anders Møller, Michael I. Sc...
CIVR
2008
Springer
166views Image Analysis» more  CIVR 2008»
15 years 8 months ago
A probabilistic ranking framework using unobservable binary events for video search
Recent content-based video retrieval systems combine output of concept detectors (also known as high-level features) with text obtained through automatic speech recognition. This ...
Robin Aly, Djoerd Hiemstra, Arjen P. de Vries, Fra...
CSL
2010
Springer
15 years 7 months ago
Ordered Sets in the Calculus of Data Structures
Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints...
Viktor Kuncak, Ruzica Piskac, Philippe Suter
163
Voted
IJAR
2006
125views more  IJAR 2006»
15 years 6 months ago
Computing best-possible bounds for the distribution of a sum of several variables is NP-hard
In many real-life situations, we know the probability distribution of two random variables x1 and x2, but we have no information about the correlation between x1 and x2; what are ...
Vladik Kreinovich, Scott Ferson
JSAT
2006
91views more  JSAT 2006»
15 years 6 months ago
Extending Existential Quantification in Conjunctions of BDDs
Abstract. We introduce new approaches intended to speed up determining the satisfiability of a given Boolean formula expressed as a conjunction of Boolean functions. A common prac...
Sean Weaver, John V. Franco, John S. Schlipf