Sciweavers

2526 search results - page 361 / 506
» A New Algorithm for Answer Set Computation
Sort
View
105
Voted
LPNMR
2009
Springer
15 years 9 months ago
Belief Revision with Bounded Treewidth
Problems arising from the revision of propositional knowledge bases have been intensively studied for two decades. Many different approaches to revision have thus been suggested, w...
Reinhard Pichler, Stefan Rümmele, Stefan Wolt...
135
Voted
FCT
2007
Springer
15 years 8 months ago
The Quantum Query Complexity of Algebraic Properties
We present quantum query complexity bounds for testing algebraic properties. For a set S and a binary operation on S, we consider the decision problem whether S is a semigroup or ...
Sebastian Dörn, Thomas Thierauf
126
Voted
CRV
2006
IEEE
223views Robotics» more  CRV 2006»
15 years 8 months ago
Disparity Map Estimation Using A Total Variation Bound
This paper describes a new variational method for estimating disparity from stereo images. The stereo matching problem is formulated as a convex programming problem in which an ob...
Wided Miled, Jean-Christophe Pesquet
ISPDC
2006
IEEE
15 years 8 months ago
Optimistically Terminating Consensus: All Asynchronous Consensus Protocols in One Framework
Optimistically Terminating Consensus (OTC) is a variant of Consensus that decides if all correct processes propose the same value. It is surprisingly easy to implement: processes ...
Piotr Zielinski
DNA
2005
Springer
134views Bioinformatics» more  DNA 2005»
15 years 8 months ago
Complexity of Compact Proofreading for Self-assembled Patterns
Abstract. Fault-tolerance is a critical issue for biochemical computation. Recent theoretical work on algorithmic self-assembly has shown that error correcting tile sets are possib...
David Soloveichik, Erik Winfree