3341 search results - page 139 / 669 » On Bounded Queries and Approximation |
CORR
2006
Springer
14 years 10 months ago
2006
Springer
This paper describes a general framework for converting online game playing algorithms into constrained convex optimization algorithms. This framework allows us to convert the wel...
ORL
2008
14 years 10 months ago
2008
We propose a method to calculate lower and upper bounds of some exponential multivariate integrals using moment relaxations and show that they asymptotically converge to the value...
CCCG
2007
14 years 11 months ago
2007
In this paper, we study a Steiner tree related problem called “Terminal Steiner Tree with Bounded Edge Length”: given a set of terminal points P in a plane, one is asked to ...
CCCG
2008
14 years 11 months ago
2008
We show that for any convex object Q in the plane, the average distance between the Fermat-Weber center of Q and the points in Q is at least 4(Q)/25, and at most 2(Q)/(3 3), wher...
COMBINATORICS
2002
14 years 10 months ago
2002
The n-th Heilbronn number, Hn, is the largest value such that n points can be placed in the unit square in such a way that all possible triangles defined by any three of the point...