480 search results - page 64 / 96 » Approximate and exact algorithms for the fixed-charge knapsa... |
JCO
2010
13 years 7 months ago
2010
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
ICIP
2007
IEEE
14 years 10 months ago
2007
IEEE
We introduce a new approach to image reconstruction from highly incomplete data. The available data are assumed to be a small collection of spectral coef?cients of an arbitrary li...
ICA
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. A new dictionary learning method for exact sparse representation is presented in this paper. As the dictionary learning methods often iteratively update the sparse coeffi...
CP
2009
Springer
14 years 3 months ago
2009
Springer
The problem of finding a collection of solutions to a combinatorial problem that is optimal in terms of an inter-solution objective function exists in many application settings. F...
MOBIHOC
2009
ACM
14 years 9 months ago
2009
ACM
Wireless mesh networks (WMN) are finding increasing usage in city-wide deployments for providing network connectivity. Mesh routers in WMNs typically use multiple wireless channel...