90 search results - page 18 / 18 » On approximating complex quadratic optimization problems via... |
DCC
2005
IEEE
14 years 5 months ago
2005
IEEE
Minimum-entropy decoding is a universal decoding algorithm used in decoding block compression of discrete memoryless sources as well as block transmission of information across di...
CORR
2007
Springer
13 years 6 months ago
2007
Springer
The problem of recovering the sparsity pattern of a fixed but unknown vector β∗ ∈ Rp based on a set of n noisy observations arises in a variety of settings, including subset...
STOC
2007
ACM
14 years 6 months ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
CGO
2011
IEEE
12 years 10 months ago
2011
IEEE
—Approximating ideal program outputs is a common technique for solving computationally difficult problems, for adhering to processing or timing constraints, and for performance ...
JMLR
2008
13 years 6 months ago
2008
We consider the problem of learning classifiers in structured domains, where some objects have a subset of features that are inherently absent due to complex relationships between...