Sciweavers

307 search results - page 33 / 62
» The convex hull of ellipsoids
Sort
View
COLT
2000
Springer
13 years 12 months ago
Entropy Numbers of Linear Function Classes
This paper collects together a miscellany of results originally motivated by the analysis of the generalization performance of the “maximum-margin” algorithm due to Vapnik and...
Robert C. Williamson, Alex J. Smola, Bernhard Sch&...
DCG
2008
101views more  DCG 2008»
13 years 7 months ago
On the Hardness of Computing Intersection, Union and Minkowski Sum of Polytopes
For polytopes P1, P2 Rd we consider the intersection P1 P2, the convex hull of the union CH(P1 P2), and the Minkowski sum P1 + P2. For Minkowski sum we prove that enumerating t...
Hans Raj Tiwary
JCT
2006
89views more  JCT 2006»
13 years 7 months ago
Revlex-initial 0/1-polytopes
We introduce revlex-initial 0/1-polytopes as the convex hulls of reverse-lexicographically initial sets of 0/1-vectors. Thus for each n 2d , we consider the 0/1-knapsack polytope ...
Rafael Gillmann, Volker Kaibel
IJDAR
2010
164views more  IJDAR 2010»
13 years 4 months ago
Distance-based classification of handwritten symbols
We study online classification of isolated handwritten symbols using distance measures on spaces of curves. We compare three distance-based measures on a vector space representatio...
Oleg Golubitsky, Stephen M. Watt
MP
2011
13 years 2 months ago
An FPTAS for minimizing the product of two non-negative linear cost functions
We consider a quadratic programming (QP) problem (Π) of the form min xT Cx subject to Ax ≥ b where C ∈ Rn×n + , rank(C) = 1 and A ∈ Rm×n , b ∈ Rm . We present an FPTAS ...
Vineet Goyal, Latife Genç Kaya, R. Ravi