2924 search results - page 217 / 585 » Lower Bounds in Distributed Computing |
122
click to vote
ICALP
2003
Springer
15 years 8 months ago
2003
Springer
We prove lower bounds for the direct sum problem for two-party bounded error randomised multipleround communication protocols. Our proofs use the notion of information cost of a p...
135
Voted
IPPS
2000
IEEE
15 years 7 months ago
2000
IEEE
Reconstructing a physical map of a chromosome from a genomic library presents a central computational problem in genetics. Physical map reconstruction in the presence of errors is...
129
Voted
IPPS
2007
IEEE
15 years 9 months ago
2007
IEEE
— We consider memory subsystem optimizations for improving the performance of sparse scientific computation while reducing the power consumed by the CPU and memory. We first co...
109
Voted
IPPS
2006
IEEE
15 years 9 months ago
2006
IEEE
Inference of phylogenetic trees using the maximum likelihood (ML) method is NP-hard. Furthermore, the computation of the likelihood function for huge trees of more than 1,000 orga...
122
Voted
IPPS
2006
IEEE
15 years 9 months ago
2006
IEEE
Recently, graphics processing units (GPUs) are providing increasingly higher performance with programmable internal processors, namely vertex processors (VPs) and fragment process...