Sciweavers

3247 search results - page 245 / 650
» Randomized smoothing networks
Sort
View
IWCMC
2006
ACM
15 years 11 months ago
Analysis of mobile beacon aided in-range localization scheme in ad hoc wireless sensor networks
In this paper, We mathematically model the In-Range localization scheme in the presence of a Mobile Beacon. In the In-Range localization scheme, a sensor with unknown location is ...
T. V. Srinath, Anil Kumar Katti, V. S. Ananthanara...
ISPAN
2005
IEEE
15 years 11 months ago
Overlay networks with class
We define a family of Distributed Hash Table systems whose aim is to combine routing efficiency of the randomized networks — i.e. average path length O(log n/ log log n) vs. t...
Giovanni Chiola, Gennaro Cordasco, Luisa Gargano, ...
CDC
2009
IEEE
119views Control Systems» more  CDC 2009»
15 years 10 months ago
Resource sharing optimality in WiFi infrastructure networks
Abstract— In WiFi networks, mobile nodes compete for accessing a shared channel by means of a random access protocol called Distributed Coordination Function (DCF). Although this...
Laura Giarré, Giovanni Neglia, Ilenia Tinni...
CORR
2007
Springer
176views Education» more  CORR 2007»
15 years 5 months ago
Crystallization in large wireless networks
—We analyze fading interference relay networks where M single-antenna source-destination terminal pairs communicate concurrently and in the same frequency band through a set of K...
Veniamin I. Morgenshtern, Helmut Bölcskei
NN
1998
Springer
15 years 5 months ago
Statistical estimation of the number of hidden units for feedforward neural networks
The number of required hidden units is statistically estimated for feedforward neural networks that are constructed by adding hidden units one by one. The output error decreases w...
Osamu Fujita