Sciweavers

1578 search results - page 7 / 316
» Algorithmic randomness of continuous functions
Sort
View
ICASSP
2011
IEEE
13 years 1 months ago
A general proof of convergence for adaptive distributed beamforming schemes
This work focuses on the convergence analysis of adaptive distributed beamforming schemes that can be reformulated as local random search algorithms via a random search framework....
Chang-Ching Chen, Chia-Shiang Tseng, Che Lin
DSN
2007
IEEE
14 years 4 months ago
R-Sentry: Providing Continuous Sensor Services against Random Node Failures
The success of sensor-driven applications is reliant on whether a steady stream of data can be provided by the underlying system. This need, however, poses great challenges to sen...
Shengchao Yu, Yanyong Zhang
BMCBI
2007
107views more  BMCBI 2007»
13 years 10 months ago
A general and efficient method for estimating continuous IBD functions for use in genome scans for QTL
Background: Identity by descent (IBD) matrix estimation is a central component in mapping of Quantitative Trait Loci (QTL) using variance component models. A large number of algor...
Francois Besnier, Örjan Carlborg
GPEM
2007
119views more  GPEM 2007»
13 years 9 months ago
Genomic mining for complex disease traits with "random chemistry"
Our rapidly growing knowledge regarding genetic variation in the human genome offers great potential for understanding the genetic etiology of disease. This, in turn, could revolut...
Margaret J. Eppstein, Joshua L. Payne, Bill C. Whi...