658 search results - page 40 / 132 » Lower bounds for sorting networks |
106
click to vote
MOBIHOC
2012
ACM
13 years 2 months ago
2012
ACM
In this paper, we characterize the throughput of a broadcast network with n receivers using rateless codes with block size K. We assume that the underlying channel is a Markov mod...
124
click to vote
ICALP
2011
Springer
14 years 3 months ago
2011
Springer
We study the problem of navigating through a database of similar objects using comparisons. This problem is known to be strongly related to the small-world network design problem....
APCCAS
2002
IEEE
15 years 4 months ago
2002
IEEE
The pyramid networks are well-known as suitable structures for parallel computations such as image processing. This paper shows a practical 3D VLSI layout of the N-vertex pyramid ...
WCE
2007
15 years 1 months ago
2007
— The rapid transit network design problem considers at upper level the list of potential transit corridors and stations to design the network as a discrete space of alternatives...
109
click to vote
ICASSP
2010
IEEE
15 years 16 hour ago
2010
IEEE
The energy-distortion function (E(D)) for a network is defined as the minimum total energy required to achieve a target distortion D at the receiver without putting any restricti...