Sciweavers

2370 search results - page 432 / 474
» The Characterization of Data-Accumulating Algorithms
Sort
View
MST
2007
167views more  MST 2007»
14 years 9 months ago
The Complexity of Polynomial-Time Approximation
In 1996, Khanna and Motwani [KM96] proposed three logic-based optimization problems constrained by planar structure, and offered the hypothesis that these putatively fundamental ...
Liming Cai, Michael R. Fellows, David W. Juedes, F...
INFOCOM
2010
IEEE
14 years 8 months ago
Neighbor Discovery with Reception Status Feedback to Transmitters
—Neighbor discovery is essential for the process of self-organization of a wireless network, where almost all routing and medium access protocols need knowledge of one-hop neighb...
Ramin Khalili, Dennis Goeckel, Donald F. Towsley, ...
INFOCOM
2010
IEEE
14 years 8 months ago
Network Coding Tomography for Network Failures
—Network Tomography (or network monitoring) uses end-to-end path-level measurements to characterize the network, such as topology estimation and failure detection. This work prov...
Hongyi Yao, Sidharth Jaggi, Minghua Chen
TIFS
2010
184views more  TIFS 2010»
14 years 8 months ago
Information-theoretically secret key generation for fading wireless channels
—The multipath-rich wireless environment associated with typical wireless usage scenarios is characterized by a fading channel response that is time-varying, location-sensitive, ...
Chunxuan Ye, Suhas Mathur, Alex Reznik, Yogendra S...
WG
2010
Springer
14 years 8 months ago
Network Exploration by Silent and Oblivious Robots
In this paper we investigate the basic problem of Exploration of a graph by a group of identical mobile computational entities, called robots, operating autonomously and asynchrono...
Jérémie Chalopin, Paola Flocchini, B...