4843 search results - page 165 / 969 » The Shortcut Problem - Complexity and Approximation |
137
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
We introduce the Multiplicative Update Selector and Estimator (MUSE) algorithm for sparse approximation in underdetermined linear regression problems. Given f = Φα∗ + µ, the ...
106
click to vote
P2P
2009
IEEE
15 years 10 months ago
2009
IEEE
Peer-to-peer (P2P) technology provides a scalable solution in multimedia streaming. Many streaming applications, such as IPTV and video conferencing, have rigorous constraints on ...
105
click to vote
INFOCOM
2008
IEEE
15 years 9 months ago
2008
IEEE
—A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which da...
130
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
Motivated by applications in grid computing and projects management, we study multiprocessor scheduling in scenarios where there is uncertainty in the successful execution of jobs...
128
click to vote
ICCV
2005
IEEE
16 years 5 months ago
2005
IEEE
A new framework is presented that uses tools from duality theory of linear programming to derive graph-cut based combinatorial algorithms for approximating NP-hard classification ...