Sciweavers

100 search results - page 15 / 20
» A distributed incremental nearest neighbor algorithm
Sort
View
TMC
2010
138views more  TMC 2010»
14 years 8 months ago
Distributed Relay-Assignment Protocols for Coverage Expansion in Cooperative Wireless Networks
—One important application of cooperative communications is to extend coverage area in wireless networks without increasing infrastructure. However, a crucial challenge in implem...
Ahmed K. Sadek, Zhu Han, K. J. Ray Liu
NIPS
2003
14 years 11 months ago
Self-calibrating Probability Forecasting
In the problem of probability forecasting the learner’s goal is to output, given a training set and a new object, a suitable probability measure on the possible values of the ne...
Vladimir Vovk, Glenn Shafer, Ilia Nouretdinov
AUTOMATICA
2008
127views more  AUTOMATICA 2008»
14 years 10 months ago
On decentralized negotiation of optimal consensus
A consensus problem consists of finding a distributed control strategy that brings the state or output of a group of agents to a common value, a consensus point. In this paper, we...
Björn Johansson, Alberto Speranzon, Mikael Jo...
JCB
2002
108views more  JCB 2002»
14 years 9 months ago
Fast and Accurate Phylogeny Reconstruction Algorithms Based on the Minimum-Evolution Principle
This paper investigates the standard ordinary least-squares version 24 and the balanced version 20 of the minimum evolution principle. For the standard version, we provide a greedy...
Richard Desper, Olivier Gascuel
SAC
2009
ACM
15 years 4 months ago
Flexible self-healing gradients
Self-healing gradients are distributed estimates of the distance from each device in a network to the nearest device designated as a source, and are used in many pervasive computi...
Jacob Beal