Sciweavers

258 search results - page 31 / 52
» Weak Bisimulation Approximants
Sort
View
COCO
1993
Springer
133views Algorithms» more  COCO 1993»
15 years 3 months ago
On Span Programs
We introduce a linear algebraic model of computation, the Span Program, and prove several upper and lower bounds on it. These results yield the following applications in complexit...
Mauricio Karchmer, Avi Wigderson
FOCS
1992
IEEE
15 years 3 months ago
Probabilistic Checking of Proofs; A New Characterization of NP
We give a new characterization of NP: the class NP contains exactly those languages L for which membership proofs (a proof that an input x is in L) can be verified probabilisticall...
Sanjeev Arora, Shmuel Safra
MOC
2002
76views more  MOC 2002»
14 years 11 months ago
Localization effects and measure source terms in numerical schemes for balance laws
Abstract. This paper investigates the behavior of numerical schemes for nonlinear conservation laws with source terms. We concentrate on two significant examples: relaxation approx...
Laurent Gosse
JC
2011
102views more  JC 2011»
14 years 6 months ago
Tractability of tensor product problems in the average case setting
It has been an open problem to derive a necessary and sufficient condition for a linear tensor product problem S = {Sd} in the average case setting to be weakly tractable but not ...
Anargyros Papageorgiou, Iasonas Petras
MOBIHOC
2006
ACM
15 years 11 months ago
Distributed localization using noisy distance and angle information
Localization is an important and extensively studied problem in ad-hoc wireless sensor networks. Given the connectivity graph of the sensor nodes, along with additional local info...
Amitabh Basu, Jie Gao, Joseph S. B. Mitchell, Giri...