1389 search results - page 196 / 278 » Improved Approximation Algorithms for Label Cover Problems |
119
click to vote
COCOON
2008
Springer
15 years 4 months ago
2008
Springer
In this paper, we study the spectrum assignment problem for wireless access networks. Opportunistic spectrum usage is a promising technology. However, it could suffer from the self...
120
click to vote
DISOPT
2008
15 years 3 months ago
2008
We define the k-path tree matroid, and use it to solve network design problems in which the required connectivity is arbitrary for a given pair of nodes, and 1 for the other pairs...
123
click to vote
ECCV
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. Markov and Conditional random fields (CRFs) used in computer vision typically model only local interactions between variables, as this is computationally tractable. In t...
135
click to vote
CVPR
2005
IEEE
16 years 5 months ago
2005
IEEE
Training datasets for learning of object categories are often contaminated or imperfect. We explore an approach to automatically identify examples that are noisy or troublesome fo...
127
click to vote
JAIR
2006
15 years 2 months ago
2006
The most basic assumption used in statistical learning theory is that training data and test data are drawn from the same underlying distribution. Unfortunately, in many applicati...