Sciweavers

971 search results - page 59 / 195
» Approximate Satisfiability and Equivalence
Sort
View
JCC
2002
127views more  JCC 2002»
13 years 9 months ago
Effective Born radii in the generalized Born approximation: The importance of being perfect
: Generalized Born (GB) models provide, for many applications, an accurate and computationally facile estimate of the electrostatic contribution to aqueous solvation. The GB models...
Alexey Onufriev, David A. Case, Donald Bashford
RANDOM
1998
Springer
14 years 2 months ago
Using Approximation Hardness to Achieve Dependable Computation
Abstract. Redundancy has been utilized to achieve fault tolerant computation and to achieve reliable communication in networks of processors. These techniques can only be extended ...
Mike Burmester, Yvo Desmedt, Yongge Wang
FOIKS
2008
Springer
13 years 11 months ago
Visibly Pushdown Transducers for Approximate Validation of Streaming XML
Visibly Pushdown Languages (VPLs), recognized by Visibly Pushdown Automata (VPAs), are a nicely behaved family of contextfree languages. It has been shown that VPAs are equivalent ...
Alex Thomo, Srinivasan Venkatesh, Ying Ying Ye
JACM
2000
131views more  JACM 2000»
13 years 9 months ago
The soft heap: an approximate priority queue with optimal error rate
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
Bernard Chazelle
ENTCS
2007
153views more  ENTCS 2007»
13 years 10 months ago
The Methods of Approximation and Lifting in Real Computation
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether de...
Manuel Lameiras Campagnolo, Kerry Ojakian