Sciweavers

SIAMJO
2010
130views more  SIAMJO 2010»
12 years 10 months ago
A Randomized Cutting Plane Method with Probabilistic Geometric Convergence
Abstract. We propose a randomized method for general convex optimization problems; namely, the minimization of a linear function over a convex body. The idea is to generate N rando...
Fabrizio Dabbene, P. S. Shcherbakov, Boris T. Poly...
IANDC
2010
87views more  IANDC 2010»
13 years 29 days ago
Effective symbolic dynamics, random points, statistical behavior, complexity and entropy
We consider the dynamical behavior of Martin-L
Stefano Galatolo, Mathieu Hoyrup, Cristobal Rojas
DCG
2010
118views more  DCG 2010»
13 years 3 months ago
Recurrence Relationships for the Mean Number of Faces and Vertices for Random Convex Hulls
: This paper studies the convex hull of n random points in Rd. A recently-proved topological identity of the author is used in combination with identities of Efron and Buchta to fi...
Richard Cowan
EUROCRYPT
2006
Springer
13 years 7 months ago
Hiding Secret Points Amidst Chaff
Motivated by the representation of biometric and multimedia objects, we consider the problem of hiding noisy point-sets using a secure sketch. A point-set X consists of s points fr...
Ee-Chien Chang, Qiming Li
ISPA
2004
Springer
13 years 9 months ago
A Scalable Low Discrepancy Point Generator for Parallel Computing
The Monte Carlo (MC) method is a simple but effective way to perform simulations involving complicated or multivariate functions. The QuasiMonte Carlo (QMC) method is similar but...
Kwong-Ip Liu, Fred J. Hickernell