Sciweavers

1734 search results - page 175 / 347
» MSDR-D Network Localization Algorithm
Sort
View
SODA
2008
ACM
100views Algorithms» more  SODA 2008»
14 years 6 days ago
A tight lower bound for parity in noisy communication networks
We show a tight lower bound of (N log log N) on the number of transmission required to compute the parity of N bits (with constant error) in a network of N randomly placed sensors...
Chinmoy Dutta, Yashodhan Kanoria, D. Manjunath, Ja...
ICONIP
2008
14 years 7 days ago
The Diversity of Regression Ensembles Combining Bagging and Random Subspace Method
Abstract. The concept of Ensemble Learning has been shown to increase predictive power over single base learners. Given the bias-variancecovariance decomposition, diversity is char...
Alexandra Scherbart, Tim W. Nattkemper
MOBIHOC
2008
ACM
14 years 10 months ago
Delay-bounded routing in vehicular ad-hoc networks
Ad hoc networks formed by traveling vehicles are envisaged to become a common platform that will support a wide variety of applications, ranging from road safety to advertising an...
Antonios Skordylis, Niki Trigoni
ISLPED
2003
ACM
138views Hardware» more  ISLPED 2003»
14 years 4 months ago
An environmental energy harvesting framework for sensor networks
Energy constrained systems such as sensor networks can increase their usable lifetimes by extracting energy from their environment. However, environmental energy will typically no...
Aman Kansal, Mani B. Srivastava
NETWORKING
2008
14 years 6 days ago
Cooperative Replication in Content Networks with Nodes under Churn
In content networks, a replication group refers to a set of nodes that cooperate with each other to retrieve information objects from a distant server. Each node locally replicates...
Eva Jaho, Ioannis Z. Koukoutsidis, Ioannis Stavrak...