895 search results - page 50 / 179 » Approximate convex decomposition |
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
We introduce the Line Search A-Function (LSAF) technique that generalizes the Extended-Baum Welch technique in order to provide an effective optimization technique for a broader s...
EUROCOLT
1999
Springer
15 years 2 months ago
1999
Springer
Abstract. Recent works have shown the advantage of using Active Learning methods, such as the Query by Committee (QBC) algorithm, to various learning problems. This class of Algori...
CORR
2011
Springer
14 years 4 months ago
2011
Springer
Following a polynomial approach, many robust fixed-order controller design problems can be formulated as optimization problems whose set of feasible solutions is modelled by para...
SODA
2012
ACM
13 years 6 days ago
2012
ACM
We give a deterministic O(log n)n -time and space algorithm for the Shortest Vector Problem (SVP) of a lattice under any norm, improving on the previous best deterministic nO(n) -...
UAI
2003
14 years 11 months ago
2003
Loopy and generalized belief propagation are popular algorithms for approximate inference in Markov random fields and Bayesian networks. Fixed points of these algorithms correspo...