Sciweavers

405 search results - page 33 / 81
» Random Number Selection in Self-assembly
Sort
View
IPPS
1997
IEEE
14 years 11 days ago
Designing Efficient Distributed Algorithms Using Sampling Techniques
In this paper we show the power of sampling techniques in designing efficient distributed algorithms. In particular, we show that using sampling techniques, on some networks, sele...
Sanguthevar Rajasekaran, David S. L. Wei
INFOCOM
2009
IEEE
14 years 3 months ago
Prize-Collecting Data Fusion for Cost-Performance Tradeoff in Distributed Inference
—A novel formulation for optimal sensor selection and in-network fusion for distributed inference known as the prizecollecting data fusion (PCDF) is proposed in terms of optimal ...
Animashree Anandkumar, Meng Wang, Lang Tong, Anant...
TNN
2010
143views Management» more  TNN 2010»
13 years 3 months ago
Using unsupervised analysis to constrain generalization bounds for support vector classifiers
Abstract--A crucial issue in designing learning machines is to select the correct model parameters. When the number of available samples is small, theoretical sample-based generali...
Sergio Decherchi, Sandro Ridella, Rodolfo Zunino, ...
BMCBI
2006
200views more  BMCBI 2006»
13 years 8 months ago
Comparison and evaluation of methods for generating differentially expressed gene lists from microarray data
Background: Numerous feature selection methods have been applied to the identification of differentially expressed genes in microarray data. These include simple fold change, clas...
Ian B. Jeffery, Desmond G. Higgins, Aedín C...
CORR
2010
Springer
124views Education» more  CORR 2010»
13 years 9 months ago
Mimicking the Behaviour of Idiotypic AIS Robot Controllers Using Probabilistic Systems
Previous work has shown that robot navigation systems that employ an architecture based upon the idiotypic network theory of the immune system have an advantage over control techn...
Amanda M. Whitbrook, Uwe Aickelin, Jonathan M. Gar...