Sciweavers

1477 search results - page 23 / 296
» Random Convex Programs
Sort
View
FSTTCS
2004
Springer
14 years 2 months ago
Testing Geometric Convexity
We consider the problem of determining whether a given set S in Rn is approximately convex, i.e., if there is a convex set K ∈ Rn such that the volume of their symmetric differe...
Luis Rademacher, Santosh Vempala
JACM
2010
135views more  JACM 2010»
13 years 7 months ago
A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries
We present a fully dynamic randomized data structure that can answer queries about the convex hull of a set of n points in three dimensions, where insertions take O(log3 n) expect...
Timothy M. Chan
COMPGEOM
2005
ACM
13 years 10 months ago
Multi-pass geometric algorithms
We initiate the study of exact geometric algorithms that require limited storage and make only a small number of passes over the input. Fundamental problems such as lowdimensional...
Timothy M. Chan, Eric Y. Chen
MOR
2006
94views more  MOR 2006»
13 years 8 months ago
Conditional Risk Mappings
We introduce an axiomatic definition of a conditional convex risk mapping and we derive its properties. In particular, we prove a representation theorem for conditional risk mappi...
Andrzej Ruszczynski, Alexander Shapiro
CVPR
2010
IEEE
14 years 4 months ago
Efficient Piecewise Learning for Conditional Random Fields
Conditional Random Field models have proved effective for several low-level computer vision problems. Inference in these models involves solving a combinatorial optimization probl...
Karteek Alahari, Phil Torr