Sciweavers

9997 search results - page 263 / 2000
» The case for crowd computing
Sort
View
PODC
2010
ACM
15 years 10 months ago
Hybrid-secure MPC: trading information-theoretic robustness for computational privacy
Most protocols for distributed, fault-tolerant computation, or multi-party computation (MPC), provide security guarantees in an all-or-nothing fashion: If the number of corrupted p...
Christoph Lucas, Dominik Raub, Ueli M. Maurer
ALT
2003
Springer
16 years 3 months ago
On the Existence and Convergence of Computable Universal Priors
Solomonoff unified Occam’s razor and Epicurus’ principle of multiple explanations to one elegant, formal, universal theory of inductive inference, which initiated the field...
Marcus Hutter
COMPGEOM
2005
ACM
15 years 8 months ago
On the exact computation of the topology of real algebraic curves
We consider the problem of computing a representation of the plane graph induced by one (or more) algebraic curves in the real plane. We make no assumptions about the curves, in p...
Raimund Seidel, Nicola Wolpert
CASES
2004
ACM
16 years 23 hour ago
Analytical computation of Ehrhart polynomials: enabling more compiler analyses and optimizations
Many optimization techniques, including several targeted specifically at embedded systems, depend on the ability to calculate the number of elements that satisfy certain conditio...
Sven Verdoolaege, Rachid Seghir, Kristof Beyls, Vi...
WINE
2009
Springer
93views Economy» more  WINE 2009»
16 years 1 months ago
On Stackelberg Pricing with Computationally Bounded Consumers
In a Stackelberg pricing game a leader aims to set prices on a subset of a given collection of items, such as to maximize her revenue from a follower purchasing a feasible subset o...
Patrick Briest, Martin Hoefer, Luciano Gualà...