1389 search results - page 209 / 278 » Improved Approximation Algorithms for Label Cover Problems |
111
click to vote
WWW
2008
ACM
16 years 3 months ago
2008
ACM
We consider the problem of ranking refinement, i.e., to improve the accuracy of an existing ranking function with a small set of labeled instances. We are, particularly, intereste...
124
click to vote
WEBI
2009
Springer
15 years 9 months ago
2009
Springer
We consider the problem of retrieving multiple documents relevant to the single subtopics of a given web query, termed “full-subtopic retrieval”. To solve this problem we pres...
119
click to vote
AAAI
2008
15 years 5 months ago
2008
Diagnosability is an essential property that determines how accurate any diagnostic reasoning can be on a system given any sequence of observations. An unobservable fault event in...
125
click to vote
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
Point estimates of the parameters in real world models convey valuable information about the actual system. However, parameter comparisons and/or statistical inference requires de...
129
click to vote
ICPR
2008
IEEE
15 years 9 months ago
2008
IEEE
Graph cut algorithms (i.e., min s-t cuts) [3][10][15] are useful in many computer vision applications. In this paper we develop a formulation that allows the addition of side cons...