1389 search results - page 111 / 278 » Improved Approximation Algorithms for Label Cover Problems |
115
click to vote
DAC
1998
ACM
16 years 4 months ago
1998
ACM
Efficient techniques for the manipulation of Binary Decision Diagrams (BDDs) are key to the success of formal verification tools. Recent advances in reachability analysis and mode...
139
click to vote
CVPR
2009
IEEE
16 years 10 months ago
2009
IEEE
Image classification and annotation are important problems
in computer vision, but rarely considered together. Intuitively,
annotations provide evidence for the class label,
and...
106
click to vote
COLT
2000
Springer
15 years 7 months ago
2000
Springer
We model reinforcement learning as the problem of learning to control a Partially Observable Markov Decision Process ( ¢¡¤£¦¥§ ), and focus on gradient ascent approache...
105
Voted
IPL
2008
15 years 3 months ago
2008
We consider the problem known as MAX-SATISFY: given a system of m linear equations over the rationals, find a maximum set of equations that can be satisfied. Let r be the width of...
114
Voted
COMPGEOM
2009
ACM
15 years 9 months ago
2009
ACM
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...