2636 search results - page 473 / 528 » Linear Programming |
CORR
2007
Springer
14 years 9 months ago
2007
Springer
We introduce S-DUDE, a new algorithm for denoising Discrete Memoryless Channel (DMC)-corrupted data. The algorithm, which generalizes the recently introduced DUDE (Discrete Univer...
IOR
2007
14 years 9 months ago
2007
Abstract. We study the problem of minimizing the maximum latency of flows in networks with congestion. We show that this problem is NP-hard, even when all arc latency functions ar...
LATIN
2010
Springer
14 years 8 months ago
2010
Springer
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...
TIT
2010
14 years 4 months ago
2010
In this paper, we study the number of measurements required to recover a sparse signal in M with L nonzero coefficients from compressed samples in the presence of noise. We conside...
TKDE
2012
13 years 7 days ago
2012
—Preparing a data set for analysis is generally the most time consuming task in a data mining project, requiring many complex SQL queries, joining tables and aggregating columns....