Sciweavers

661 search results - page 103 / 133
» On Distributed Computation in Noisy Random Planar Networks
Sort
View
GLOBECOM
2007
IEEE
15 years 4 months ago
Cooperative Beamforming for Wireless Ad Hoc Networks
—Via collaborative beamforming, nodes in a wireless network are able to transmit a common message over long distances in an energy efficient fashion. However, the process of mak...
Lun Dong, Athina P. Petropulu, H. Vincent Poor
ICDCS
2008
IEEE
15 years 10 months ago
Circumventing Server Bottlenecks: Indirect Large-Scale P2P Data Collection
In most large-scale peer-to-peer (P2P) applications, it is necessary to collect vital statistics data — sometimes referred to as logs — from up to millions of peers. Tradition...
Di Niu, Baochun Li
SPAA
2003
ACM
15 years 9 months ago
A practical algorithm for constructing oblivious routing schemes
In a (randomized) oblivious routing scheme the path chosen for a request between a source s and a target t is independent from the current traffic in the network. Hence, such a sc...
Marcin Bienkowski, Miroslaw Korzeniowski, Harald R...
ADHOC
2006
97views more  ADHOC 2006»
15 years 4 months ago
A probabilistic algorithm for efficient and robust data propagation in wireless sensor networks
We study the problem of data propagation in sensor networks, comprised of a large number of very small and low-cost nodes, capable of sensing, communicating and computing. The dis...
Ioannis Chatzigiannakis, Tassos Dimitriou, Sotiris...
SIGIR
2009
ACM
15 years 10 months ago
On social networks and collaborative recommendation
Social network systems, like last.fm, play a significant role in Web 2.0, containing large amounts of multimedia-enriched data that are enhanced both by explicit user-provided an...
Ioannis Konstas, Vassilios Stathopoulos, Joemon M....