Sciweavers

13007 search results - page 2240 / 2602
» Wireless and Mobile Networking
Sort
View
NIPS
2003
15 years 5 months ago
Online Learning of Non-stationary Sequences
We consider an online learning scenario in which the learner can make predictions on the basis of a fixed set of experts. We derive upper and lower relative loss bounds for a cla...
Claire Monteleoni, Tommi Jaakkola
CORR
2008
Springer
139views Education» more  CORR 2008»
15 years 4 months ago
The Secrecy Graph and Some of its Properties
A new random geometric graph model, the so-called secrecy graph, is introduced and studied. The graph represents a wireless network and includes only edges over which secure commun...
Martin Haenggi
COMCOM
2006
103views more  COMCOM 2006»
15 years 4 months ago
Energy efficiency of collision resolution protocols
Energy consumption of the medium access control (MAC) algorithm is one of the key performance metrics in today's ubiquitous wireless networks of battery-operated devices. We ...
Aran Bergman, Moshe Sidi
JPDC
2006
134views more  JPDC 2006»
15 years 4 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong
VTC
2010
IEEE
151views Communications» more  VTC 2010»
15 years 2 months ago
Cooperative Multicast with Low-Cost Radios
—A simple cooperative diversity technique is applied to point-to-multipoint communication in wireless medium suffering from Rayleigh block fading. Such a concept is especially in...
Nikolaj Marchenko, Christian Bettstetter
« Prev « First page 2240 / 2602 Last » Next »