Sciweavers

450 search results - page 48 / 90
» Satisfiability with Exponential Families
Sort
View
FORMATS
2004
Springer
15 years 3 months ago
A Unified Fault-Tolerance Protocol
Davies and Wakerly show that Byzantine fault tolerance can be achieved by a cascade of broadcasts and middle value select functions. We present an extension of the Davies and Waker...
Paul S. Miner, Alfons Geser, Lee Pike, Jeffrey Mad...
SGP
2007
15 years 2 months ago
Discrete laplace operators: no free lunch
Discrete Laplace operators are ubiquitous in applications spanning geometric modeling to simulation. For robustness and efficiency, many applications require discrete operators th...
Max Wardetzky, Saurabh Mathur, Felix Kälberer...
DLOG
2008
15 years 2 months ago
Rewriting Rules into SROIQ Axioms
Description Logics are a family of very expressive logics but some forms of knowledge are much more intuitive to formulate otherwise, say, as rules. Rules in DL can be dealt with t...
Francis Gasse, Ulrike Sattler, Volker Haarslev
JCSS
2008
107views more  JCSS 2008»
14 years 11 months ago
A unified theory of structural tractability for constraint satisfaction problems
In this paper we derive a generic form of structural decomposition for the constraint satisfaction problem, which we call a guarded decomposition. We show that many existing decom...
David A. Cohen, Peter Jeavons, Marc Gyssens
CAD
2004
Springer
14 years 11 months ago
Parametric representation of a surface pencil with a common spatial geodesic
In this paper, we study the problem of constructing a family of surfaces from a given spatial geodesic curve. We derive a parametric representation for a surface pencil whose memb...
Guo-Jin Wang, Kai Tang, Chiew-Lan Tai