7930 search results - page 590 / 1586 » Greedy in Approximation Algorithms |
211
click to vote
VLDB
2004
ACM
16 years 15 days ago
2004
ACM
We address the problem of computing approximate answers to continuous sliding-window joins over data streams when the available memory may be insufficient to keep the entire join...
227
click to vote
WAOA
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. We consider the train delivery problem which is a generalization of the bin packing problem and is equivalent to a one dimensional version of the vehicle routing problem ...
202
click to vote
ICASSP
2011
IEEE
14 years 11 months ago
2011
IEEE
This paper presents a novel spatial texture prediction method based on non-negative matrix factorization. As an extension of template matching, approximation based iterative textu...
188
click to vote
IPPS
2005
IEEE
16 years 23 days ago
2005
IEEE
: A fundamental problem in communication networks is wavelength assignment (WA): given a set of routing paths on a network, assign a wavelength to each path such that the paths wit...
178
click to vote
IJCNN
2000
IEEE
15 years 11 months ago
2000
IEEE
The class of piecewise linear homeomorphisms (PLH) provides a convenient functional representation for many applications wherein an approximation to data is required that is inver...