Sciweavers

3247 search results - page 391 / 650
» Randomized smoothing networks
Sort
View
INFOCOM
2008
IEEE
16 years 1 months ago
Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints
—A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which da...
Deepti Chafekar, V. S. Anil Kumar, Madhav V. Marat...
INFOCOM
2008
IEEE
16 years 1 months ago
Non-Metric Coordinates for Predicting Network Proximity
—We consider the problem of determining the “closest”, or best Internet host to connect to, from a list of candidate servers. Most existing approaches rely on the use of metr...
Peter B. Key, Laurent Massoulié, Dan-Cristi...
PIMRC
2008
IEEE
16 years 1 months ago
Dynamic data aggregation and transport in wireless sensor networks
—In wireless sensor networks, in-network aggregation is the process of compressing locally the data gathered by the sensor nodes, so that only the compressed data travel across s...
Mario O. Diaz, Kin K. Leung
SP
2008
IEEE
103views Security Privacy» more  SP 2008»
16 years 1 months ago
Preserving Caller Anonymity in Voice-over-IP Networks
— Applications such as VoIP need to provide anonymity to clients while maintaining low latency to satisfy quality of service (QoS) requirements. Existing solutions for providing ...
Mudhakar Srivatsa, Ling Liu, Arun Iyengar
SRDS
2008
IEEE
16 years 1 months ago
Towards Reliable Reputations for Dynamic Networked Systems
A new generation of distributed systems and applications rely on the cooperation of diverse user populations motivated by self-interest. While they can utilize “reputation syste...
Gayatri Swamynathan, Ben Y. Zhao, Kevin C. Almerot...