Sciweavers

2421 search results - page 83 / 485
» Approximate Flow-Aware Networking
Sort
View
SIGCOMM
2010
ACM
14 years 10 months ago
Design and implementation of an "approximate" communication system for wireless media applications
All practical wireless communication systems are prone to errors. At the symbol level such wireless errors have a well-defined structure: when a receiver decodes a symbol erroneou...
Sayandeep Sen, Syed Gilani, Shreesha Srinath, Step...
IMC
2006
ACM
15 years 3 months ago
Approximate fingerprinting to accelerate pattern matching
Pattern matching and analysis over network data streams is increasingly becoming an essential primitive of network monitoring systems. It is a fundamental part of most intrusion d...
Ramaswamy Ramaswamy, Lukas Kencl, Gianluca Iannacc...
ALGORITHMICA
2005
99views more  ALGORITHMICA 2005»
14 years 10 months ago
Improved Approximation Algorithms for the Quality of Service Multicast Tree Problem
Abstract. The Quality of Service Multicast Tree Problem is a generalization of the Steiner tree problem which appears in the context of multimedia multicast and network design. In ...
Marek Karpinski, Ion I. Mandoiu, Alexander Olshevs...
ICASSP
2011
IEEE
14 years 1 months ago
Optimal and low-complexity iterative joint network/channel decoding for the multiple-access relay channel
In this paper, we investigate joint network and channel decoding algorithms for the multiple-access relay channel. We consider a realistic reference scenario with Rayleigh fading ...
Xuan-Thang Vu, Marco Di Renzo, Pierre Duhamel
ICDE
2012
IEEE
191views Database» more  ICDE 2012»
13 years 12 days ago
Processing and Notifying Range Top-k Subscriptions
— We consider how to support a large number of users over a wide-area network whose interests are characterized by range top-k continuous queries. Given an object update, we need...
Albert Yu, Pankaj K. Agarwal, Jun Yang 0001