69 search results - page 7 / 14 » Near-Linear Time Approximation Algorithms for Curve Simplifi... |
IVC
2007
13 years 7 months ago
2007
We consider simple cube-curves in the orthogonal 3D grid of cells. The union of all cells contained in such a curve (also called the tube of this curve) is a polyhedrally bounded s...
AAAI
2010
13 years 9 months ago
2010
The problem of dividing a sequence of values into segments occurs in database systems, information retrieval, and knowledge management. The challenge is to select a finite number ...
COMPGEOM
2006
ACM
14 years 1 months ago
2006
ACM
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
We present discrete stochastic mathematical models for the growth curves of synchronous and asynchronous evolutionary algorithms with populations structured according to a random ...
ISAAC
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We consider bicriteria optimization problems and investigate the relationship between two standard approaches to solving them: (i) computing the Pareto curve and (ii) the...