194 search results - page 24 / 39 » The Parameterized Complexity of Some Minimum Label Problems |
144
click to vote
PAMI
2008
14 years 12 months ago
2008
A common way to model multiclass classification problems is by means of Error-Correcting Output Codes (ECOCs). Given a multiclass problem, the ECOC technique designs a code word fo...
CN
2006
15 years 15 days ago
2006
Several dynamic QoS routing techniques have been recently proposed for new IP networks based on label forwarding. However, no extensive performance evaluation and comparison is av...
108
Voted
STOC
2009
ACM
16 years 1 months ago
2009
ACM
This paper studies constant-time approximation algorithms for problems on degree-bounded graphs. Let n and d be the number of vertices and the degree bound, respectively. This pap...
204
click to vote
CVPR
2012
IEEE
13 years 2 months ago
2012
IEEE
A large number of problems in computer vision can be modeled as energy minimization problems in a markov random field (MRF) framework. Many methods have been developed over the y...
114
Voted
LICS
2006
IEEE
15 years 6 months ago
2006
IEEE
— In a data word each position carries a label from a finite alphabet and a data value from some infinite domain. These models have been already considered in the realm of semi...