Sciweavers

26 search results - page 4 / 6
» Network Coding Theory Via Commutative Algebra
Sort
View
INFOCOM
2009
IEEE
14 years 12 days 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
INFOCOM
2009
IEEE
14 years 12 days ago
Minimizing Delay for Multicast-Streaming in Wireless Networks with Network Coding
—Network coding is a method that promises to achieve the min-cut capacity in multicasts. However, pushing towards this gain in throughput comes with two sacrifices. Delay suffer...
Wai-Leong Yeow, Anh Tuan Hoang, Chen-Khong Tham

Publication
118views
14 years 7 months ago
The Minimum Circuity Frontier and the Journey to Work
People travel between places of residence and work destinations via transportation net- works. The relation between selection of home and work locations has been heavily debated ...
Levinson, D. and El-Geneidy A.
EUROCRYPT
2007
Springer
13 years 12 months ago
Secure Computation from Random Error Correcting Codes
Abstract. Secure computation consists of protocols for secure arithmetic: secret values are added and multiplied securely by networked processors. The striking feature of secure co...
Hao Chen, Ronald Cramer, Shafi Goldwasser, Robbert...
GLOBECOM
2010
IEEE
13 years 3 months ago
Graph-Based Optimization for Relay-Assisted Bidirectional Cellular Networks
This paper considers a relay-assisted bidirectional cellular network where the base station (BS) communicates with each mobile station (MS) using orthogonal frequency-division mult...
Yuan Liu, Meixia Tao