Sciweavers

1612 search results - page 78 / 323
» Analysing Randomized Distributed Algorithms
Sort
View
TSP
2010
14 years 4 months ago
Distributed estimation of channel gains in wireless sensor networks
We consider the problem of distributed channel estimation in a sensor network which employs a random sleep strategy to conserve energy. If the N network nodes are randomly placed a...
Sivagnanasundaram Ramanan, John MacLaren Walsh
TACAS
2010
Springer
137views Algorithms» more  TACAS 2010»
15 years 4 months ago
Statistical Measurement of Information Leakage
Information theory provides a range of useful methods to analyse probability distributions and these techniques have been successfully applied to measure information flow and the ...
Konstantinos Chatzikokolakis, Tom Chothia, Apratim...
3DIM
2001
IEEE
15 years 1 months ago
The Parallel Iterative Closest Point Algorithm
This paper describes a parallel implementation developed to improve the time performance of the Iterative Closest Point Algorithm. Within each iteration, the correspondence calcul...
Christian Langis, Michael A. Greenspan, Guy Godin
BMCBI
2010
190views more  BMCBI 2010»
14 years 10 months ago
Sample size and statistical power considerations in high-dimensionality data settings: a comparative study of classification alg
Background: Data generated using `omics' technologies are characterized by high dimensionality, where the number of features measured per subject vastly exceeds the number of...
Yu Guo, Armin Graber, Robert N. McBurney, Raji Bal...
IJCAI
2007
14 years 11 months ago
Training Conditional Random Fields Using Virtual Evidence Boosting
While conditional random fields (CRFs) have been applied successfully in a variety of domains, their training remains a challenging task. In this paper, we introduce a novel trai...
Lin Liao, Tanzeem Choudhury, Dieter Fox, Henry A. ...