Sciweavers

159 search results - page 29 / 32
» Codes identifying sets of vertices in random networks
Sort
View
MP
1998
109views more  MP 1998»
13 years 7 months ago
Rounding algorithms for covering problems
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
Dimitris Bertsimas, Rakesh V. Vohra
TSP
2012
12 years 3 months ago
Robust Multicast Beamforming for Spectrum Sharing-Based Cognitive Radios
Abstract—We consider a robust downlink beamforming optimization problem for secondary multicast transmission in a multiple-input multiple-output (MIMO) spectrum sharing cognitive...
Yongwei Huang, Qiang Li, Wing-Kin Ma, Shuzhong Zha...
CORR
2010
Springer
99views Education» more  CORR 2010»
13 years 7 months ago
A New Phase Transition for Local Delays in MANETs
: We study a slotted version of the Aloha Medium Access (MAC) protocol in a Mobile Ad-hoc Network (MANET). Our model features transmitters randomly located in the Euclidean plane, ...
François Baccelli, Bartek Blaszczyszyn
INFOCOM
2007
IEEE
14 years 1 months ago
Gossiping with Multiple Messages
Abstract— This paper investigates the dissemination of multiple pieces of information in large networks where users contact each other in a random uncoordinated manner, and users...
Sujay Sanghavi, Bruce Hajek, Laurent Massouli&eacu...
CCS
2007
ACM
14 years 1 months ago
Memsherlock: an automated debugger for unknown memory corruption vulnerabilities
Software vulnerabilities have been the main contributing factor to the Internet security problems such as fast spreading worms. Among these software vulnerabilities, memory corrup...
Emre Can Sezer, Peng Ning, Chongkyung Kil, Jun Xu