2924 search results - page 287 / 585 » Lower Bounds in Distributed Computing |
138
click to vote
AIEDAM
2008
15 years 4 months ago
2008
Although it is known that quantum computers can solve certain computational problems exponentially faster than classical computers, only a small number of quantum algorithms have ...
153
click to vote
MFCS
2010
Springer
15 years 2 months ago
2010
Springer
We consider evaluating one bilinear form defined by a sparse Ny × Nx matrix A having h entries on w pairs of vectors The model of computation is the semiring I/O-model with main ...
137
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
The classical problem of reliable point-to-point digital communication is to achieve a low probability of error while keeping the rate high and the total power consumption small. ...
150
click to vote
MOBIHOC
2008
ACM
16 years 4 months ago
2008
ACM
We address the cost incurred in increasing the transport capacity of wireless ad hoc networks over what can be attained when sources and destinations communicate over multi-hop pa...
143
click to vote
DCC
2002
IEEE
16 years 4 months ago
2002
IEEE
- We consider a joint source-channel coding system that protects an embedded wavelet bitstream against noise using a finite family of channel codes with error detection and error c...