3946 search results - page 87 / 790 » The computational complexity of choice sets |
205
click to vote
CIAC
2006
Springer
15 years 10 months ago
2006
Springer
We consider the minimum line covering problem: given a set S of n points in the plane, we want to find the smallest number l of straight lines needed to cover all n points in S. W...
143
click to vote
DCG
2008
15 years 6 months ago
2008
Let S Rk+m be a compact semi-algebraic set defined by P1 0, . . . , P 0, where Pi R[X1, . . . , Xk, Y1, . . . , Ym], and deg(Pi) 2, 1 i . Let denote the standard projection f...
183
click to vote
ECCC
2006
15 years 6 months ago
2006
Suppose you ran a chess tournament, everybody played everybody, and you wanted to use the results to rank everybody. Unless you were really lucky, the results would not be acyclic...
160
click to vote
JMLR
2008
15 years 6 months ago
2008
Classifiers favoring sparse solutions, such as support vector machines, relevance vector machines, LASSO-regression based classifiers, etc., provide competitive methods for classi...
168
click to vote
CP
2010
Springer
15 years 5 months ago
2010
Springer
Research on constraint propagation has primarily focused on designing polynomial-time propagators sometimes at the cost of a weaker filtering. Interestingly, the evolution of cons...