Sciweavers

2252 search results - page 372 / 451
» Lower Bounds for Dynamic Algorithms
Sort
View
GLOBECOM
2009
IEEE
13 years 6 months ago
Time-Critical Data Dissemination in Cooperative Peer-to-Peer Systems
How to rapidly disseminate a large-sized file to many recipients is a fundamental problem in many applications, such as updating software patches and distributing large scientific ...
Chi-Jen Wu, Cheng-Ying Li, Kai-Hsiang Yang, Jan-Mi...
TALG
2011
98views more  TALG 2011»
13 years 3 months ago
Tree exploration with logarithmic memory
We consider the task of network exploration by a mobile agent (robot) with small memory. The agent has to traverse all nodes and edges of a network (represented as an undirected c...
Christoph Ambühl, Leszek Gasieniec, Andrzej P...
JCT
2011
86views more  JCT 2011»
13 years 3 months ago
Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs
The circumference of a graph is the length of its longest cycles. Results of Jackson, and Jackson and Wormald, imply that the circumference of a 3-connected cubic n-vertex graph i...
Mark Bilinski, Bill Jackson, Jie Ma, Xingxing Yu
CISS
2011
IEEE
13 years 21 days ago
Noncoherent compressive sensing with application to distributed radar
—We consider a multi-static radar scenario with spatially dislocated receivers that can individually extract delay information only. Furthermore, we assume that the receivers are...
Christian R. Berger, Josee M. F. Moura
INFOCOM
2011
IEEE
13 years 19 days ago
Construction of directional virtual backbones with minimum routing cost in wireless networks
—It is well-known that the application of directional antennas can help conserve bandwidth and energy consumption in wireless networks. Thus, to achieve efficiency in wireless n...
Ling Ding, Weili Wu, James Willson, Hongjie Du, Wo...