608 search results - page 52 / 122 » On Dependent Randomized Rounding Algorithms |
148
click to vote
WEA
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Mobile users are roaming in a zone of cells in a cellular network system. The probabilities of each user residing in each cell are known, and all probabilities are indepe...
CORR
2010
Springer
15 years 18 days ago
2010
Springer
We present and evaluate GPU Bucket Sort, a parallel deterministic sample sort algorithm for many-core GPUs. Our method is considerably faster than Thrust Merge (Satish et.al., Pro...
150
click to vote
CEC
2008
IEEE
15 years 7 months ago
2008
IEEE
— Quasirandom or low discrepancy sequences, such as the Van der Corput, Sobol, Faure, Halton (named after their inventors) etc. are less random than a pseudorandom number sequenc...
116
Voted
SODA
2008
ACM
15 years 1 months ago
2008
ACM
A common approach for dealing with large data sets is to stream over the input in one pass, and perform computations using sublinear resources. For truly massive data sets, howeve...
125
Voted
ICDAR
2009
IEEE
14 years 10 months ago
2009
IEEE
This paper presents a new approach for the binarization of seriously degraded manuscript. We introduce a new technique based on a Markov Random Field (MRF) model of the document. ...