16404 search results - page 273 / 3281 » A set coverage problem |
141
click to vote
ICML
2006
IEEE
16 years 5 months ago
2006
IEEE
Most work on preference learning has focused on pairwise preferences or rankings over individual items. In this paper, we present a method for learning preferences over sets of it...
149
click to vote
ICML
2001
IEEE
16 years 5 months ago
2001
IEEE
We generalize the classical algorithms of Valiant and Haussler for learning conjunctions and disjunctions of Boolean attributes to the problem of learning these functions over arb...
133
click to vote
COMPGEOM
2006
ACM
15 years 10 months ago
2006
ACM
Let S be a finite set of n + 3 points in general position in the plane, with 3 extreme points and n interior points. We consider triangulations drawn uniformly at random from the...
138
click to vote
WEA
2005
Springer
15 years 10 months ago
2005
Springer
This work is motivated by the long-standing open problem of designing a polynomial-time algorithm that with high probability constructs an asymptotically maximum independent set in...
137
click to vote
ASP
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. Often graphs are used to investigate properties of logic programs. In general, different graphs represent different kinds of information of the corresponding programs. ...