Sciweavers

990 search results - page 168 / 198
» An efficient data structure for network anomaly detection
Sort
View
STOC
2002
ACM
140views Algorithms» more  STOC 2002»
14 years 8 months ago
Finding nearest neighbors in growth-restricted metrics
Most research on nearest neighbor algorithms in the literature has been focused on the Euclidean case. In many practical search problems however, the underlying metric is non-Eucl...
David R. Karger, Matthias Ruhl
HPDC
2007
IEEE
13 years 11 months ago
MOB: zero-configuration high-throughput multicasting for grid applications
Grid applications often need to distribute large amounts of data efficiently from one cluster to multiple others (multicast). Existing methods usually arrange nodes in optimized t...
Mathijs den Burger, Thilo Kielmann
COMCOM
2004
153views more  COMCOM 2004»
13 years 7 months ago
BLR: beacon-less routing algorithm for mobile ad hoc networks
Routing of packets in mobile ad hoc networks with a large number of nodes or with high mobility is a very difficult task and current routing protocols do not really scale well wit...
Marc Heissenbüttel, Torsten Braun, Thomas Ber...
MASS
2010
161views Communications» more  MASS 2010»
13 years 2 months ago
Mode switch - Adaptive use of delay-sensitive or energy-aware communication in IEEE 802.15.4-based networks
Abstract--We propose "mode switch", an adaptive loadsensitive solution that supports both an energy-efficient operation mode for transmitting normal sensor data and an Qo...
Feng Chen, Xiaoyu Tong, Edith Ngar, Falko Dressler
ICPP
2006
IEEE
14 years 1 months ago
Improving Spatial Reuse with Collision-Aware DCF in Mobile Ad Hoc Networks
—Carrier sensing is a medium access method widely adopted in wireless communication to protect data transfers from interference. For example, Distributed Coordination Function (D...
Lubo Song, Chansu Yu