2354 search results - page 212 / 471 » Randomness, Stochasticity and Approximations |
150
Voted
ICDE
2010
IEEE
16 years 4 months ago
2010
IEEE
Abstract-- This paper introduces a deterministic approximation algorithm with error guarantees for computing the probability of propositional formulas over discrete random variable...
108
Voted
ESA
2009
Springer
15 years 11 months ago
2009
Springer
In this paper we consider both the maximization variant Max Rep and the minimization variant Min Rep of the famous Label Cover problem, for which, till now, the best approximation ...
128
click to vote
COMPGEOM
2009
ACM
15 years 11 months ago
2009
ACM
We present the Iterated-Tverberg algorithm, the first deterministic algorithm for computing an approximate centerpoint of a set S ∈ Rd with running time sub-exponential in d. T...
150
click to vote
WAW
2007
Springer
15 years 10 months ago
2007
Springer
Betweenness is a centrality measure based on shortest paths, widely used in complex network analysis. It is computationally-expensive to exactly determine betweenness; currently th...
145
Voted
STACS
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. We consider the problem of scheduling jobs on related machines owned by selfish agents and provide the first deterministic mechanisms with constant approximation that a...