1279 search results - page 77 / 256 » Approximation Algorithms for Min-Max Generalization Problems |
159
click to vote
APPROX
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
119
click to vote
SODA
2008
ACM
15 years 3 months ago
2008
ACM
The Traveling Salesman Problem (TSP) is a canonical NP-complete problem which is known to be MAXSNP hard even on Euclidean metrics (of high dimensions) [40]. In order to circumven...
102
click to vote
WWW
2005
ACM
16 years 2 months ago
2005
ACM
Personalized PageRank expresses backlink-based page quality around user-selected pages in a similar way to PageRank over the entire Web. Algorithms for computing personalized Page...
122
click to vote
CVPR
2009
IEEE
16 years 9 months ago
2009
IEEE
Many problems in computer vision can be modeled using
conditional Markov random fields (CRF). Since finding
the maximum a posteriori (MAP) solution in such models
is NP-hard, mu...
110
click to vote
ATAL
2010
Springer
15 years 2 months ago
2010
Springer
In the course allocation problem, a university administrator seeks to efficiently and fairly allocate schedules of over-demanded courses to students with heterogeneous preferences...