Sciweavers

27 search results - page 2 / 6
» High-Throughput Random Access via Codes on Graphs
Sort
View
INFOCOM
2009
IEEE
13 years 11 months ago
Robust Counting Via Counter Braids: An Error-Resilient Network Measurement Architecture
—A novel counter architecture, called Counter Braids, has recently been proposed for accurate per-flow measurement on high-speed links. Inspired by sparse random graph codes, Co...
Yi Lu, Balaji Prabhakar
ICC
2007
IEEE
142views Communications» more  ICC 2007»
13 years 11 months ago
On MAC Scheduling and Packet Combination Strategies for Practical Random Network Coding
— The present paper investigates practical algorithms to efficiently exploit random network coding for data delivery in multi-hop wireless networks. In the past few years, a gre...
Elena Fasolo, Michele Rossi, Jörg Widmer, Mic...
BMCBI
2010
172views more  BMCBI 2010»
13 years 5 months ago
Accessing the SEED genome databases via Web services API: tools for programmers
Background: The SEED integrates many publicly available genome sequences into a single resource. The database contains accurate and up-to-date annotations based on the subsystems ...
Terry Disz, Sajia Akhter, Daniel Cuevas, Robert Ol...
TMC
2010
109views more  TMC 2010»
13 years 3 months ago
On the Performance Bounds of Practical Wireless Network Coding
—Network coding is an attracting technology that has been shown to be able to improve the throughput of wireless networks. However, there still lacks fundamental understanding on...
Jilin Le, John C. S. Lui, Dah-Ming Chiu
FOCS
2003
IEEE
13 years 10 months ago
On the Implementation of Huge Random Objects
We initiate a general study of pseudo-random implementations of huge random objects, and apply it to a few areas in which random objects occur naturally. For example, a random obj...
Oded Goldreich, Shafi Goldwasser, Asaf Nussboim