989 search results - page 149 / 198 » Approximating the Pareto optimal set using a reduced set of ... |
SPAA
2003
ACM
14 years 1 months ago
2003
ACM
In the classical load balancing or multiprocessor scheduling problem, we are given a sequence of jobs of varying sizes and are asked to assign each job to one of the m empty proce...
EMMCVPR
1997
Springer
14 years 10 days ago
1997
Springer
Abstract. In this paper a rigorous mathematical framework of deterministic annealing and mean-field approximation is presented for a general class of partitioning, clustering and ...
CIKM
2011
Springer
12 years 8 months ago
2011
Springer
A continuous top-k query retrieves the k most preferred objects in a data stream according to a given preference function. These queries are important for a broad spectrum of appl...
SCIA
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Filter networks, i.e. decomposition of a filter set into a layered structure of sparse subfilters has been proven successful for e.g. efficient convolution using finit...
CG
2007
Springer
13 years 8 months ago
2007
Springer
We present a novel method for determining local multiresolution filters for a broad range of subdivision schemes. Our approach is based on constraining the wavelet coefficients s...