Sciweavers

2372 search results - page 236 / 475
» Probabilistic calling context
Sort
View
QEST
2010
IEEE
13 years 6 months ago
On the Theory of Stochastic Processors
Traditional architecture design approaches hide hardware uncertainties from the software stack through overdesign, which is often expensive in terms of power consumption. The recen...
Parasara Sridhar Duggirala, Sayan Mitra, Rakesh Ku...
CSE
2009
IEEE
13 years 6 months ago
Edge Anonymity in Social Network Graphs
Edges in social network graphs can model sensitive relationships. In this paper, we consider the problem of edges anonymity in graphs. We propose a probabilistic notion of edge ano...
Lijie Zhang, Weining Zhang
INTERSPEECH
2010
13 years 3 months ago
Dynamic model selection for spectral voice conversion
Statistical methods for voice conversion are usually based on a single model selected in order to represent a tradeoff between goodness of fit and complexity. In this paper we ass...
Pierre Lanchantin, Xavier Rodet
JCST
2010
189views more  JCST 2010»
13 years 3 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
JMLR
2010
102views more  JMLR 2010»
13 years 3 months ago
Efficient Algorithms for Conditional Independence Inference
The topic of the paper is computer testing of (probabilistic) conditional independence (CI) implications by an algebraic method of structural imsets. The basic idea is to transfor...
Remco R. Bouckaert, Raymond Hemmecke, Silvia Lindn...