2899 search results - page 153 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
149
Voted
WG
1998
Springer
15 years 10 months ago
1998
Springer
Hierarchical decompositions of graphs are interesting for algorithmic purposes. There are several types of hierarchical decompositions. Tree decompositions are the best known ones....
186
Voted
CONSTRAINTS
2008
15 years 6 months ago
2008
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...
136
click to vote
ORL
2008
15 years 6 months ago
2008
We consider the problem to sell items to a set of bidders. Bidders bid on bundles of items, and each item's availability is unbounded, like for digital goods. We need to dete...
152
click to vote
TIP
2002
15 years 5 months ago
2002
Abstract--This paper deals with the design and implementation of an image transform coding algorithm based on the integer wavelet transform (IWT). First of all, criteria are propos...
161
click to vote
ICIP
2010
IEEE
15 years 4 months ago
2010
IEEE
The compression of video can reduce the accuracy of post-compression tracking algorithms. This is problematic for centralized applications such as traffic surveillance systems, wh...