Sciweavers

13784 search results - page 253 / 2757
» On Computing Functions with Uncertainty
Sort
View
CCA
2009
Springer
14 years 4 months ago
Weihrauch Degrees, Omniscience Principles and Weak Computability
Abstract. In this paper we study a reducibility that has been introduced by Klaus Weihrauch or, more precisely, a natural extension of this reducibility for multi-valued functions ...
Vasco Brattka, Guido Gherardi
CRYPTO
2004
Springer
120views Cryptology» more  CRYPTO 2004»
14 years 3 months ago
Round-Optimal Secure Two-Party Computation
Abstract. We consider the central cryptographic task of secure twoparty computation, where two parties wish to compute some function of their private inputs (each receiving possibl...
Jonathan Katz, Rafail Ostrovsky
IPPS
2008
IEEE
14 years 4 months ago
Model-based fault localization in large-scale computing systems
We propose a new fault localization technique for software bugs in large-scale computing systems. Our technique always collects per-process function call traces of a target system...
Naoya Maruyama, Satoshi Matsuoka
JFP
2000
91views more  JFP 2000»
13 years 9 months ago
Uniform confluence in concurrent computation
Indeterminism is typical for concurrent computation. If several concurrent actors compete for the same resource then at most one of them may succeed, whereby the choice of the suc...
Joachim Niehren
CVPR
2007
IEEE
14 years 11 months ago
Evaluation of Cost Functions for Stereo Matching
Stereo correspondence methods rely on matching costs for computing the similarity of image locations. In this paper we evaluate the insensitivity of different matching costs with ...
Daniel Scharstein, Heiko Hirschmüller