Sciweavers

1477 search results - page 71 / 296
» Random Convex Programs
Sort
View
ICALP
2000
Springer
15 years 8 months ago
Two-coloring Random Hypergraphs
: A 2-coloring of a hypergraph is a mapping from its vertex set to a set of two colors such that no edge is monochromatic. Let H = H k n p be a random k-uniform hypergraph on a ver...
Dimitris Achlioptas, Jeong Han Kim, Michael Krivel...
FOCS
2009
IEEE
15 years 11 months ago
Randomized Self-Assembly for Exact Shapes
— Working in Winfree’s abstract tile assembly model, we show that a constant-size tile assembly system can be programmed through relative tile concentrations to build an n × n...
David Doty
ICML
2007
IEEE
16 years 5 months ago
Efficiently computing minimax expected-size confidence regions
Given observed data and a collection of parameterized candidate models, a 1- confidence region in parameter space provides useful insight as to those models which are a good fit t...
Brent Bryan, H. Brendan McMahan, Chad M. Schafer, ...
IWPEC
2004
Springer
15 years 10 months ago
The Minimum Weight Triangulation Problem with Few Inner Points
We propose to look at the computational complexity of 2-dimensional geometric optimization problems on a finite point set with respect to the number of inner points (that is, poi...
Michael Hoffmann, Yoshio Okamoto
WSC
2008
15 years 7 months ago
Optimizing portfolio tail measures: Asymptotics and efficient simulation optimization
We consider a portfolio allocation problem where the objective function is a tail event such as probability of large portfolio losses. The dependence between assets is captured th...
Sandeep Juneja