2168 search results - page 170 / 434 » Randomized Algorithms and Complexity Theory |
119
Voted
STOC
2002
ACM
16 years 3 months ago
2002
ACM
The collision problem is to decide whether a function X : {1, . . . , n} {1, . . . , n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of...
172
Voted
FOGA
2011
14 years 7 months ago
2011
It was recently proven that sets of points maximizing the hypervolume indicator do not give a good multiplicative approximation of the Pareto front. We introduce a new “logarith...
150
Voted
TAMC
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. In this paper, we give streaming algorithms for some problems which are known to be in deterministic log-space, when the number of passes made on the input is unbounded. ...
236
Voted
CVPR
2012
IEEE
13 years 6 months ago
2012
IEEE
A large number of problems in computer vision can be modeled as energy minimization problems in a markov random field (MRF) framework. Many methods have been developed over the y...
150
click to vote
PDPTA
2004
15 years 4 months ago
2004
Random data placement has recently emerged as an alternative to traditional data striping. From a performance perspective, it has been demonstrated to be an efficient and scalable...