Sciweavers

307 search results - page 21 / 62
» The convex hull of ellipsoids
Sort
View
CORR
2010
Springer
112views Education» more  CORR 2010»
13 years 7 months ago
Transdichotomous Results in Computational Geometry, II: Offline Search
We reexamine fundamental problems from computational geometry in the word RAM model, where input coordinates are integers that fit in a machine word. We develop a new algorithm fo...
Timothy M. Chan, Mihai Patrascu
SIAMJO
2002
73views more  SIAMJO 2002»
13 years 7 months ago
Nonlinearly Constrained Best Approximation in Hilbert Spaces: The Strong CHIP and the Basic Constraint Qualification
We study best approximation problems with nonlinear constraints in Hilbert spaces. The strong "conical hull intersection property" (CHIP) and the "basic constraint q...
Chong Li, Xiao-Qing Jin
ORL
2011
12 years 10 months 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
IWCIA
2009
Springer
14 years 5 days ago
What Does Digital Straightness Tell about Digital Convexity?
Abstract. The paper studies local convexity properties of parts of digital boundaries. An online and linear-time algorithm is introduced for the decomposition of a digital boundary...
Tristan Roussillon, Laure Tougne, Isabelle Sivigno...
TIT
1998
70views more  TIT 1998»
13 years 7 months ago
The Importance of Convexity in Learning with Squared Loss
We show that if the closureof a function class F under the metric induced by some probability distribution is not convex, then the sample complexity for agnostically learning F wi...
Wee Sun Lee, Peter L. Bartlett, Robert C. Williams...