2020 search results - page 54 / 404 » Speeding up Slicing |
ICALP
2009
Springer
14 years 10 months ago
2009
Springer
In this paper we extend the study of flow-energy scheduling to a model that allows both sleep management and speed scaling. Our main result is a sleep management algorithm called I...
SIGMOD
1998
ACM
14 years 2 months ago
1998
ACM
In this paper, we propose the Pyramid-Technique, a new indexing method for high-dimensional data spaces. The PyramidTechnique is highly adapted to range query processing using the...
AIPS
2004
13 years 11 months ago
2004
We present new results on the problem of finding an enclosing rectangle of minimum area that will contain a given a set of rectangles. Many simple scheduling tasks can be modelled...
AIPS
2003
13 years 11 months ago
2003
Given a set of rectangles with fixed orientations, we want to find an enclosing rectangle of minimum area that contains them all with no overlap. Many simple scheduling tasks ca...
ICDE
2007
IEEE
14 years 11 months ago
2007
IEEE
The All Nearest Neighbor (ANN) operation is a commonly used primitive for analyzing large multi-dimensional datasets. Since computing ANN is very expensive, in previous works R*-t...