3875 search results - page 418 / 775 » Approximation algorithms for the 0-extension problem |
149
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
We introduce a natural generalization of submodular set cover and exact active learning with a finite hypothesis class (query learning). We call this new problem interactive submo...
179
Voted
CSDA
2006
15 years 6 months ago
2006
We propose a simulation-based method for calculating maximum likelihood estimators in latent variable models. The proposed method integrates a recently developed sampling strategy...
187
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...
174
click to vote
INFOCOM
2005
IEEE
16 years 11 days 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 ...
154
click to vote
ICA
2010
Springer
15 years 7 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...