Sciweavers

608 search results - page 52 / 122
» On Dependent Randomized Rounding Algorithms
Sort
View
WEA
2010
Springer
284views Algorithms» more  WEA 2010»
14 years 3 months ago
Paging Multiple Users in Cellular Network: Yellow Page and Conference Call Problems
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...
Amotz Bar-Noy, Panagiotis Cheilaris, Yi Feng 0002
CORR
2010
Springer
221views Education» more  CORR 2010»
13 years 9 months ago
Deterministic Sample Sort For GPUs
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...
Frank Dehne, Hamidreza Zaboli
CEC
2008
IEEE
14 years 3 months ago
Improved Particle Swarm Optimization with low-discrepancy sequences
— 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...
Millie Pant, Radha Thangaraj, Crina Grosan, Ajith ...
SODA
2008
ACM
126views Algorithms» more  SODA 2008»
13 years 10 months ago
On distributing symmetric streaming computations
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...
Jon Feldman, S. Muthukrishnan, Anastasios Sidiropo...
ICDAR
2009
IEEE
13 years 6 months ago
Document Image Binarisation Using Markov Field Model
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. ...
Thibault Lelore, Frédéric Bouchara