7006 search results - page 1126 / 1402 » Approximation Algorithms |
200
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Recent work has demonstrated that using a carefully designed dictionary instead of a predefined one, can improve the sparsity in jointly representing a class of signals. This has m...
187
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
A well studied special case of bin packing is the 3-partition problem, where n items of size > 1 4 have to be packed in a minimum number of bins of capacity one. The famous Kar...
160
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Nonnegative matrix factorization (NMF) was popularized as a tool for data mining by Lee and Seung in 1999. NMF attempts to approximate a matrix with nonnegative entries by a produ...
164
click to vote
CCE
2006
15 years 6 months ago
2006
In this paper, we address the problem of optimal synthesis of an integrated water system, where water using processes and water treatment operations are combined into a single net...
130
click to vote
FMSD
2006
15 years 6 months ago
2006
We propose a refinement approach to language emptiness, which is based on the enumeration and the successive refinements of SCCs on over-approximations of the exact system. Our alg...