986 search results - page 70 / 198 » Algorithmic Lower Bounds for Problems Parameterized by Cliqu... |
146
click to vote
UAI
2008
15 years 4 months ago
2008
We address the problem of computing approximate marginals in Gaussian probabilistic models by using mean field and fractional Bethe approximations. As an extension of Welling and ...
131
click to vote
STOC
1992
ACM
15 years 7 months ago
1992
ACM
Abstract. We describe two methods for estimating the size and depth of decision trees where a linear test is performed at each node. Both methods are applied to the question of dec...
120
click to vote
JCSS
2008
15 years 3 months ago
2008
We study the problem of sorting binary sequences and permutations by length-weighted reversals. We consider a wide class of cost functions, namely f( ) = for all 0, where is the...
136
Voted
IPL
2002
15 years 3 months ago
2002
One of the main reasons for using parallel evolutionary algorithms (PEAs) is to obtain efficient algorithms with an execution time much lower than that of their sequential counter...
143
Voted
ISPD
2004
ACM
15 years 9 months ago
2004
ACM
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...