1272 search results - page 70 / 255 » The Set Cover with Pairs Problem |
110
click to vote
TITB
2011
14 years 7 months ago
2011
— Ultrasound images segmentation is a difficult problem due to speckle noise, low contrast and local changes of intensity. Intensity based methods do not perform particularly we...
110
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...
97
Voted
AAAI
2011
14 years 24 days ago
2011
The conservation of wildlife corridors between existing habitat preserves is important for combating the effects of habitat loss and fragmentation facing species of concern. We in...
119
click to vote
COCO
2004
Springer
15 years 4 months ago
2004
Springer
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
105
Voted
ECML
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. In this paper, we propose a new method for learning to rank. `Ranking SVM' is a method for performing the task. It formulizes the problem as that of binary classific...