519 search results - page 43 / 104 » A New Approach to Strongly Polynomial Linear Programming |
KR
1998
Springer
15 years 5 months ago
1998
Springer
We study the problem of probabilistic deduction with conditional constraints over basic events. We show that globallycomplete probabilistic deduction with conditional constraints ...
121
click to vote
SOFSEM
2010
Springer
15 years 10 months ago
2010
Springer
We present a new technique to prove termination of Term Rewriting Systems, with full automation. A crucial task in this context is to find suitable well-founded orderings. A popul...
118
click to vote
CORR
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Support Vector Machines (SVMs) are well-established Machine Learning (ML) algorithms. They rely on the fact that i) linear learning can be formalized as a well-posed opti...
114
click to vote
ETS
2009
IEEE
14 years 11 months ago
2009
IEEE
We optimize the full-response diagnostic fault dictionary from a given test set. The smallest set of vectors is selected without loss of diagnostic resolution of the given test se...
100
click to vote
CVPR
2010
IEEE
15 years 9 months ago
2010
IEEE
Markov random fields with higher order potentials have emerged as a powerful model for several problems in computer vision. In order to facilitate their use, we propose a new rep...