545 search results - page 45 / 109 » Simultaneous approximation by greedy algorithms |
135
click to vote
FOCS
2000
IEEE
15 years 7 months ago
2000
IEEE
Abstract. In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given ...
260
click to vote
DAC
2011
ACM
14 years 3 months ago
2011
ACM
In this paper, a new sparse approximation technique is proposed for incremental power grid analysis. Our proposed method is motivated by the observation that when a power grid net...
156
click to vote
ICIP
2007
IEEE
16 years 5 months ago
2007
IEEE
In this paper we propose novel algorithms for total variation (TV) based image restoration and parameter estimation utilizing variational distribution approximations. By following...
121
click to vote
IJBC
2007
15 years 4 months ago
2007
A Chaitin Omega number is the halting probability of a universal prefix-free Turing machine. Every Omega number is simultaneously computably enumerable (the limit of a computable...
122
click to vote
ICML
2006
IEEE
16 years 4 months ago
2006
IEEE
We present a discrete spectral framework for the sparse or cardinality-constrained solution of a generalized Rayleigh quotient. This NPhard combinatorial optimization problem is c...