Sciweavers

1359 search results - page 142 / 272
» Probabilistic Points-to Analysis
Sort
View
JCST
2010
189views more  JCST 2010»
14 years 4 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
ICASSP
2011
IEEE
14 years 1 months ago
Recent progress in prosodic speaker verification
We describe recent progress in the field of prosodic modeling for speaker verification. In a previous paper, we proposed a technique for modeling syllable-based prosodic feature...
Marcel Kockmann, Luciana Ferrer, Lukas Burget, Eli...
BMCBI
2005
169views more  BMCBI 2005»
14 years 9 months ago
Genetic interaction motif finding by expectation maximization - a novel statistical model for inferring gene modules from synthe
Background: Synthetic lethality experiments identify pairs of genes with complementary function. More direct functional associations (for example greater probability of membership...
Yan Qi 0003, Ping Ye, Joel S. Bader
CIKM
1998
Springer
15 years 2 months ago
Continual Computation Policies for Utility-Directed Prefetching
People accessing documents via the Internet typically experience latencies in retrieving content. We discuss continual-computation policies that dictate strategies for prefetching...
Eric Horvitz
DAGM
1998
Springer
15 years 2 months ago
Discrete Mixture Models for Unsupervised Image Segmentation
This paper introduces a novel statistical mixture model for probabilistic clustering of histogram data and, more generally, for the analysis of discrete co occurrence data. Adoptin...
Jan Puzicha, Joachim M. Buhmann, Thomas Hofmann