Sciweavers

3096 search results - page 113 / 620
» Theory and Use of the EM Algorithm
Sort
View
CORR
2010
Springer
149views Education» more  CORR 2010»
15 years 4 months ago
Group Testing with Probabilistic Tests: Theory, Design and Application
Identification of defective members of large populations has been widely studied in the statistics community under the name of group testing. It involves grouping subsets of items...
Mahdi Cheraghchi, Ali Hormati, Amin Karbasi, Marti...
CVPR
2006
IEEE
16 years 6 months ago
Control Theory and Fast Marching Techniques for Brain Connectivity Mapping
We propose a novel, fast and robust technique for the computation of anatomical connectivity in the brain. Our approach exploits the information provided by Diffusion Tensor Magne...
Emmanuel Prados, Stefano Soatto, Christophe Lengle...
JCST
2010
189views more  JCST 2010»
14 years 11 months ago
Formally Analyzing Expected Time Complexity of Algorithms Using Theorem Proving
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
Osman Hasan, Sofiène Tahar
AIIA
2003
Springer
15 years 9 months ago
Improving the SLA Algorithm Using Association Rules
A bayesian network is an appropriate tool for working with uncertainty and probability, that are typical of real-life applications. In literature we find different approaches for b...
Evelina Lamma, Fabrizio Riguzzi, Andrea Stambazzi,...
GECCO
2008
Springer
131views Optimization» more  GECCO 2008»
15 years 5 months ago
The study for transportation planning considered the inventory using hybrid genetic algorithm
The transportation planning (TP) is well-known basic network problem. However, for some real-world applications, it is often that the TP model is extended to satisfy other additio...
Shinichiro Ataka, Mitsuo Gen