7129 search results - page 458 / 1426 » Approximation Algorithms for Treewidth |
187
Voted
ICCS
2001
Springer
15 years 11 months ago
2001
Springer
Abstract Parallel algorithms for the approximation of a multi-dimensional integral over an hyper-rectangular region are discussed. Algorithms based on quasi-Monte Carlo techniques ...
194
click to vote
FOCS
2008
IEEE
16 years 26 days ago
2008
IEEE
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...
188
click to vote
VLDB
2004
ACM
15 years 11 months 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...
205
click to vote
WAOA
2010
Springer
15 years 4 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 ...
175
click to vote
ICASSP
2011
IEEE
14 years 10 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...