3874 search results - page 305 / 775 » Approximation Algorithms for k-hurdle Problems |
175
click to vote
APPROX
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. This work considers the problem of approximating fixed predicate constraint satisfaction problems (MAX k-CSP(P)). We show that if the set of assignments accepted by P co...
317
click to vote
ICDE
2008
IEEE
16 years 8 months ago
2008
IEEE
In recent years, there has been significant interest in development of ranking functions and efficient top-k retrieval algorithms to help users in ad-hoc search and retrieval in da...
146
click to vote
ECIR
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. In this work we study the theoretical and empirical properties of various global inference algorithms for multi-document summarization. We start by defining a general fr...
169
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
This paper studies the issue of space coordinate change in genetic algorithms, based on two methods: convex quadratic approximations, and principal component analysis. In both met...
190
click to vote
JMLR
2010
15 years 1 months ago
2010
It is probably fair to say that exact inference in graphical models is considered a solved problem, at least regarding its computational complexity: it is exponential in the treew...