Sciweavers

ICUMT
2009
13 years 2 months ago
sDLS - Distributed Least Squares localization for large Wireless Sensor Networks
Wireless Sensor Networks (WSNs) have been of high interest during the past couple of years. One of the most important aspect of WSN research is location estimation. As a good solut...
Ralf Behnke, Jakob Salzmann, Dominik Lieckfeldt, D...
TON
2010
118views more  TON 2010»
13 years 2 months ago
ILP formulations for p-cycle design without candidate cycle enumeration
—The concept of p-cycle (preconfigured protection cycle) allows fast and efficient span protection in wavelength division multiplexing (WDM) mesh networks. To design p-cycles f...
Bin Wu, Kwan L. Yeung, Pin-Han Ho
INTR
2007
81views more  INTR 2007»
13 years 4 months ago
Network externality and future usage of Internet services
Purpose – The purpose of this paper is to investigate different effects of three network externality factors, i.e. local network size, network strength, and total network size, ...
Sung Yong Chun, Minhi Hahn
DSN
2004
IEEE
13 years 8 months ago
Robust Aggregation Protocols for Large-Scale Overlay Networks
Aggregation refers to a set of functions that provide global information about a distributed system. These functions operate on numeric values distributed over the system and can ...
Alberto Montresor, Márk Jelasity, Özal...
PODC
1999
ACM
13 years 9 months ago
Computing Anonymously with Arbitrary Knowledge
We provide characterizations of the relations that can be computed with arbitrary knowledge on networks where all processors use the same algorithm and start from the same state (...
Paolo Boldi, Sebastiano Vigna
WDAG
2001
Springer
76views Algorithms» more  WDAG 2001»
13 years 9 months ago
An Effective Characterization of Computability in Anonymous Networks
We provide effective (i.e., recursive) characterizations of the relations that can be computed on networks where all processors use the same algorithm, start from the same state, a...
Paolo Boldi, Sebastiano Vigna
AI
2001
Springer
13 years 9 months ago
The Bottom-Up Freezing: An Approach to Neural Engineering
This paper presents a new pruning method to determine a nearly optimum multi-layer neural network structure. The aim of the proposed method is to reduce the size of the network by ...
Ali Farzan, Ali A. Ghorbani
INFOCOM
2002
IEEE
13 years 9 months ago
A Scalable Approach to the Partition of QoS Requirements in Unicast and Multicast
—Supporting quality of service (QoS) in large-scale broadband networks poses major challenges, due to the intrinsic complexity of the corresponding resource allocation problems. ...
Ariel Orda, Alexander Sprintson
PERCOM
2003
ACM
13 years 9 months ago
Study of Distance Vector Routing Protocols for Mobile Ad Hoc Networks
We investigate the performance issues of destinationsequenced distance vector (DSDV) and ad-hoc on-demand distance vector (AODV) routing protocols for mobile ad hoc networks. Four...
Yi Lu, Weichao Wang, Yuhui Zhong, Bharat K. Bharga...
EUROPAR
2004
Springer
13 years 10 months ago
Improving the Scalability of Logarithmic-Degree DHT-Based Peer-to-Peer Networks
High scalability in Peer-to-Peer (P2P) systems has been achieved with the emergence of the networks based on Distributed Hash Table (DHT). Most of the DHTs can be regarded as expon...
Bruno Carton, Valentin Mesaros