Sciweavers

7891 search results - page 528 / 1579
» Local Area Networking
Sort
View
COMBINATORICS
2002
62views more  COMBINATORICS 2002»
15 years 7 months ago
New Lower Bounds for Heilbronn Numbers
The n-th Heilbronn number, Hn, is the largest value such that n points can be placed in the unit square in such a way that all possible triangles defined by any three of the point...
Francesc Comellas, J. Luis A. Yebra
ECCC
2011
171views ECommerce» more  ECCC 2011»
14 years 10 months ago
Testing Linear Properties: Some general themes
The last two decades have seen enormous progress in the development of sublinear-time algorithms — i.e., algorithms that examine/reveal properties of “data” in less time tha...
Madhu Sudan
CISS
2010
IEEE
14 years 10 months ago
The maximum stable broadcast throughput for wireless line networks with network coding and topology control
—We consider broadcasting from a single source to multiple destinations in a linear wireless erasure network with feedback. The problem is to find the maximum stable throughput ...
Ka-Hung Hui, Yalin Evren Sagduyu, Dongning Guo, Ra...
DSD
2008
IEEE
166views Hardware» more  DSD 2008»
16 years 1 months ago
Pearson - based Analysis of Positioning Error Distribution in Wireless Sensor Networks
Abstract—In two recent contributions [1], [2], we have provided a comparative analysis of various optimization algorithms, which can be used for atomic location estimation, and s...
Stefano Tennina, Marco Di Renzo, Fabio Graziosi, F...
ADHOC
2007
144views more  ADHOC 2007»
15 years 7 months ago
Adaptive gossip protocols: Managing security and redundancy in dense ad hoc networks
Abstract. Many ad hoc routing algorithms rely on broadcast flooding for location discovery or, more generally, for secure routing applications. Flooding is a robust algorithm but ...
Mike Burmester, Tri Van Le, Alec Yasinsac