Sciweavers

34 search results - page 2 / 7
» Lattices of convex normal functions
Sort
View
COMGEO
2006
ACM
13 years 5 months ago
A new algorithmic approach to the computation of Minkowski functionals of polyconvex sets
An algorithm is proposed for the simultaneous computation of all Minkowski functionals (except for the volume) of sets from the convex ring in Rd discretized with respect to a give...
Simone Klenk, Volker Schmidt, Evgueni Spodarev
FOCS
2010
IEEE
13 years 3 months ago
Learning Convex Concepts from Gaussian Distributions with PCA
We present a new algorithm for learning a convex set in n-dimensional space given labeled examples drawn from any Gaussian distribution. The complexity of the algorithm is bounded ...
Santosh Vempala
MICS
2010
107views more  MICS 2010»
13 years 3 months ago
The Newton Polygon of a Rational Plane Curve
The Newton polygon of the implicit equation of a rational plane curve is explicitly determined by the multiplicities of any of its parametrizations. We give an intersection-theoret...
Carlos D'Andrea, Martín Sombra
SIAMCO
2010
119views more  SIAMCO 2010»
13 years 3 days ago
On the Structure of the Minimum Time Function
A minimum time problem with a nonlinear smooth dynamics and a target satisfying an internal sphere condition is considered. Under the assumption that the minimum time T be continu...
Giovanni Colombo, Khai T. Nguyen
DCG
1999
81views more  DCG 1999»
13 years 5 months ago
Properties of Random Triangulations and Trees
Let Tn denote the set of triangulations of a convex polygon K with n sides. We study functions that measure very natural "geometric" features of a triangulation Tn, fo...
Luc Devroye, Philippe Flajolet, Ferran Hurtado, Ma...