Sciweavers

985 search results - page 71 / 197
» Piercing Convex Sets
Sort
View
ORL
2011
13 years 28 days ago
Random half-integral polytopes
We show that half-integral polytopes obtained as the convex hull of a random set of half-integral points of the 0/1 cube have rank as high as Ω(log n/ log log n) with positive pr...
Gábor Braun, Sebastian Pokutta
FMSD
2006
104views more  FMSD 2006»
13 years 10 months ago
Some ways to reduce the space dimension in polyhedra computations
Convex polyhedra are often used to approximate sets of states of programs involving numerical variables. The manipulation of convex polyhedra relies on the so-called double descri...
Nicolas Halbwachs, David Merchat, Laure Gonnord
JMLR
2012
12 years 16 days ago
Perturbation based Large Margin Approach for Ranking
We consider the task of devising large-margin based surrogate losses for the learning to rank problem. In this learning to rank setting, the traditional hinge loss for structured ...
Eunho Yang, Ambuj Tewari, Pradeep D. Ravikumar
TOG
2012
237views Communications» more  TOG 2012»
12 years 16 days ago
An algebraic model for parameterized shape editing
We present an approach to high-level shape editing that adapts the structure of the shape while maintaining its global characteristics. Our main contribution is a new algebraic mo...
Martin Bokeloh, Michael Wand, Hans-Peter Seidel, V...
HPDC
2007
IEEE
14 years 4 months ago
Scalable, fault-tolerant management in a service oriented architecture
With the emergence of Service-based architectures, management of an application which comprises of a large number of distributed services becomes difficult as resources appear, mo...
Harshawardhan Gadgil, Geoffrey Fox, Shrideep Palli...