3874 search results - page 386 / 775 » Approximation Algorithms for k-hurdle Problems |
166
click to vote
JMLR
2006
15 years 6 months ago
2006
The problem of finding the most probable (MAP) configuration in graphical models comes up in a wide range of applications. In a general graphical model this problem is NP hard, bu...
154
click to vote
INFOCOM
2005
IEEE
15 years 12 months ago
2005
IEEE
— Providing approximate max-min fair bandwidth allocation among flows within a network or at a single router has been an important research problem. In this paper, we study the ...
149
click to vote
ICA
2010
Springer
15 years 6 months ago
2010
Springer
The problem of estimating a sparse channel, i.e. a channel with a few non-zero taps, appears in many fields of communication including acoustic underwater or wireless transmissions...
172
click to vote
IJCSA
2007
15 years 6 months ago
2007
The problem of task assignment in heterogeneous computing systems has been studied for many years with many variations. We have developed a new hybrid approximation algorithm. The...
163
click to vote
SECON
2008
IEEE
16 years 19 days ago
2008
IEEE
Abstract—In contrast to existing work on the connected coverage problem in wireless sensor networks which assumes omnidirectional sensors with disk-like sensing range, this paper...