1547 search results - page 28 / 310 » Randomized Variable Elimination |
100
click to vote
SODA
2003
ACM
15 years 3 months ago
2003
ACM
With random inputs, certain decision problems undergo a “phase transition”. We prove similar behavior in an optimization context. Given a conjunctive normal form (CNF) formula...
104
click to vote
UAI
2004
15 years 3 months ago
2004
As real-world Bayesian networks continue to grow larger and more complex, it is important to investigate the possibilities for improving the performance of existing algorithms of ...
113
click to vote
CP
1997
Springer
15 years 6 months ago
1997
Springer
Abstract. Combinatorial search methods often exhibit a large variability in performance. We study the cost pro les of combinatorial search procedures. Our study reveals some intrig...
132
click to vote
IJON
2007
15 years 2 months ago
2007
This paper addresses the problem of variable ranking for Support Vector Regression. The relevance criteria that we proposed are based on leave-one-out bounds and some variants and...
124
click to vote
ICML
2007
IEEE
16 years 3 months ago
2007
IEEE
We study the problem of learning kernel machines transductively for structured output variables. Transductive learning can be reduced to combinatorial optimization problems over a...