Sciweavers

630 search results - page 64 / 126
» Hardness results for approximating the bandwidth
Sort
View
IPPS
2006
IEEE
15 years 6 months ago
Analysis of a reconfigurable network processor
In this paper an analysis of a dynamically reconfigurable processor is presented. The network processor incorporates a processor and a number of coprocessors that can be connected...
Christopher Kachris, Stamatis Vassiliadis
MSS
2000
IEEE
81views Hardware» more  MSS 2000»
15 years 5 months ago
Compact Holographic Read/Write Memory
— We examine the primary challenges for building a practical and competitive holographic random access memory (HRAM) system, specifically size, speed, and cost. We show that a fa...
Wenhai Liu, Demetri Psaltis
GLOBECOM
2009
IEEE
15 years 4 months ago
R-Code: Network Coding Based Reliable Broadcast in Wireless Mesh Networks with Unreliable Links
Broadcast is an important primitive in wireless mesh networks (WMNs). Applications like network-wide software update require reliable reception of the content with low-latency and ...
Zhenyu Yang, Ming Li, Wenjing Lou
102
Voted
EUROSYS
2008
ACM
15 years 2 months ago
Efficient guaranteed disk request scheduling with fahrrad
Guaranteed I/O performance is needed for a variety of applications ranging from real-time data collection to desktop multimedia to large-scale scientific simulations. Reservations...
Anna Povzner, Tim Kaldewey, Scott A. Brandt, Richa...
COCOON
2009
Springer
15 years 7 months ago
On Finding Small 2-Generating Sets
Given a set of positive integers S, we consider the problem of finding a minimum cardinality set of positive integers X (called a minimum 2-generating set of S) s.t. every element...
Isabelle Fagnot, Guillaume Fertin, Stéphane...