Sciweavers

8431 search results - page 1635 / 1687
» Algorithmically Independent Sequences
Sort
View
RSA
1998
93views more  RSA 1998»
13 years 8 months ago
Parallel randomized load balancing
It is well known that after placing n balls independently and uniformly at random into n bins, the fullest bin holds (logn=log logn) balls with high probability. Recently, Azar et...
Micah Adler, Soumen Chakrabarti, Michael Mitzenmac...
JSAC
2010
138views more  JSAC 2010»
13 years 7 months ago
Dynamic conjectures in random access networks using bio-inspired learning
—Inspired by the biological entities’ ability to achieve reciprocity in the course of evolution, this paper considers a conjecture-based distributed learning approach that enab...
Yi Su, Mihaela van der Schaar
PRL
2010
173views more  PRL 2010»
13 years 7 months ago
Resolving stereo matching errors due to repetitive structures using model information
This study regards the problem of incorrect stereo matches due to the occurrence of repetitive structures in the scene. In stereo vision, repetitive structures may lead to “phan...
Björn Barrois, Marcus Konrad, Christian W&oum...
PVLDB
2010
112views more  PVLDB 2010»
13 years 7 months ago
Two-way Replacement Selection
The performance of external sorting using merge sort is highly dependent on the length of the runs generated. One of the most commonly used run generation strategies is Replacemen...
Xavier Martinez-Palau, David Dominguez-Sal, Josep-...
SIGMETRICS
2010
ACM
152views Hardware» more  SIGMETRICS 2010»
13 years 7 months ago
A fluid approximation for large-scale service systems
We introduce and analyze a deterministic fluid model that serves as an approximation for the Gt/GI/st + GI manyserver queueing model, which has a general time-varying arrival pro...
Yunan Liu, Ward Whitt
« Prev « First page 1635 / 1687 Last » Next »