4428 search results - page 804 / 886 » The Chow Parameters Problem |
134
click to vote
SPAA
1995
ACM
15 years 7 months ago
1995
ACM
We study the problem of sorting on a parallel computer with limited communication bandwidth. By using the PRAM(m) model, where p processors communicate through a globally shared me...
127
click to vote
ATAL
2008
Springer
15 years 6 months ago
2008
Springer
We study the complexity of manipulation for a family of election systems derived from Copeland voting via introducing a parameter that describes how ties in head-to-head contests...
144
click to vote
EMSOFT
2008
Springer
15 years 5 months ago
2008
Springer
Because of its small form factor, high capacity, and expected low cost, MEMS-based storage is a suitable storage technology for mobile systems. However, flash memory may outperfor...
127
click to vote
APPROX
2010
Springer
15 years 5 months ago
2010
Springer
We give a simple combinatorial proof of the Chernoff-Hoeffding concentration bound [Che52, Hoe63], which says that the sum of independent {0, 1}-valued random variables is highly ...
166
click to vote
APBC
2008
15 years 5 months ago
2008
: Finding motifs and the corresponding binding sites is a critical and challenging problem in studying the process of gene expression. String and matrix representations are two pop...