Sciweavers

806 search results - page 42 / 162
» Lower Bounds on Correction Networks
Sort
View
ICALP
2011
Springer
14 years 9 months ago
Content Search through Comparisons
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....
Amin Karbasi, Stratis Ioannidis, Laurent Massouli&...
APCCAS
2002
IEEE
100views Hardware» more  APCCAS 2002»
15 years 11 months ago
On three-dimensional layout of pyramid networks
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 ...
T. Yamada, N. Fujii, S. Ueno
WCE
2007
15 years 7 months ago
Stochastic Urban Rapid Transit Network Design
— 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...
Carlos Bouza, Gemayzel Bouza, Ángel Mar&iac...
ICASSP
2010
IEEE
15 years 6 months ago
Energy efficient lossy transmission over sensor networks with feedback
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...
Aman Jain, Deniz Gündüz, Sanjeev R. Kulk...
SRDS
1999
IEEE
15 years 10 months ago
On Diffusing Updates in a Byzantine Environment
We study how to efficiently diffuse updates to a large distributed system of data replicas, some of which may exhibit arbitrary (Byzantine) failures. We assume that strictly fewer...
Dahlia Malkhi, Yishay Mansour, Michael K. Reiter