Sciweavers

848 search results - page 72 / 170
» Randomness and the linear degrees of computability
Sort
View
SIAMJO
2008
97views more  SIAMJO 2008»
14 years 11 months ago
New Formulations for Optimization under Stochastic Dominance Constraints
Stochastic dominance constraints allow a decision-maker to manage risk in an optimization setting by requiring their decision to yield a random outcome which stochastically domina...
James Luedtke
IJCGA
2002
69views more  IJCGA 2002»
14 years 11 months ago
On Deletion in Delaunay Triangulations
This paper presents how the space of spheres and shelling may be used to delete a point from a d-dimensional triangulation efficiently. In dimension two, if k is the degree of the...
Olivier Devillers
COMPGEOM
2006
ACM
15 years 5 months ago
How to get close to the median shape
In this paper, we study the problem of L1-fitting a shape to a set of point, where the target is to minimize the sum of distances of the points to the shape, or alternatively the...
Sariel Har-Peled
COCO
1997
Springer
144views Algorithms» more  COCO 1997»
15 years 4 months ago
Polynomial Vicinity Circuits and Nonlinear Lower Bounds
We study families of Boolean circuits with the property that the number of gates at distance t fanning into or out of any given gate in a circuit is bounded above by a polynomial ...
Kenneth W. Regan
EUROCRYPT
2011
Springer
14 years 3 months ago
Homomorphic Signatures for Polynomial Functions
We construct the first homomorphic signature scheme that is capable of evaluating multivariate polynomials on signed data. Given the public key and a signed data set, there is an...
Dan Boneh, David Mandell Freeman