986 search results - page 47 / 198 » Algorithmic Lower Bounds for Problems Parameterized by Cliqu... |
121
Voted
FOCS
2002
IEEE
15 years 8 months ago
2002
IEEE
We consider the problem of testing functions for the property of being a k-junta (i.e., of depending on at most k variables). Fischer, Kindler, Ron, Safra, and Samorodnitsky (J. Co...
131
Voted
JAIR
2011
14 years 6 months ago
2011
We address the problem of computing approximate marginals in Gaussian probabilistic models by using mean field and fractional Bethe approximations. We define the Gaussian fracti...
105
click to vote
EUROPAR
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. We consider parallel prefix computation on processors of different and possibly changing speeds. Extending previous works on identical processors, we provide a lower boun...
113
Voted
COCOON
2007
Springer
15 years 9 months ago
2007
Springer
We consider the problem of scheduling a set of equal-length intervals arriving online, where each interval is associated with a weight and the objective is to maximize the total we...
129
click to vote
RECOMB
2006
Springer
16 years 3 months ago
2006
Springer
Meiotic recombination is a fundamental biological event and one of the principal evolutionary forces responsible for shaping genetic variation within species. In addition to its fu...