407 search results - page 17 / 82 » The Optimal Online Algorithms for Minimizing Maximum Latenes... |
107
click to vote
IJCV
2011
14 years 4 months ago
2011
This paper is devoted to the optimization problem of continuous multipartitioning, or multi-labeling, which is based on a convex relaxation of the continuous Potts model. In contr...
JCO
2011
14 years 4 months ago
2011
Discrete gate sizing is a critical optimization in VLSI circuit design. Given a set of available gate sizes, discrete gate sizing problem asks to assign a size to each gate such th...
WAIM
2007
Springer
15 years 3 months ago
2007
Springer
The constructions of Haar wavelet synopses for large data sets have proven to be useful tools for data approximation. Recently, research on constructing wavelet synopses with a gua...
ESA
2004
Springer
15 years 1 months ago
2004
Springer
The main contribution of this paper is an optimal bounded space online algorithm for variable-sized multidimensional packing. In this problem, hyperboxes must be packed in ddimens...
ICRA
2010
IEEE
14 years 8 months ago
2010
IEEE
We present an efficient algorithm for solving the ray-shooting problem on high dimensional sets. Our algorithm computes the intersection of the boundary of a compact convex set w...