1647 search results - page 78 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
138
click to vote
HVEI
2009
15 years 2 months ago
2009
The classical approach to converting colour to greyscale is to code the luminance signal as a grey value image. However, the problem with this approach is that the detail at equil...
162
click to vote
WDAG
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
172
click to vote
ASAP
2004
IEEE
15 years 8 months ago
2004
IEEE
Dynamic programming for approximate string matching is a large family of different algorithms, which vary significantly in purpose, complexity, and hardware utilization. Many impl...
127
click to vote
SODA
1997
ACM
15 years 6 months ago
1997
ACM
We study graph partitioning problems on graphs with edge capacities and vertex weights. The problems of b-balanced cuts and k-balanced partitions are unified into a new problem ca...
146
click to vote
ADHOCNOW
2008
Springer
15 years 11 months ago
2008
Springer
Abstract. The Minimum-Power k-Connected Subgraph (MPkCS) problem seeks a power (range) assignment to the nodes of a given wireless network such that the resulting communication (su...