Sciweavers

675 search results - page 8 / 135
» Algorithms for estimating relative importance in networks
Sort
View
SEMWEB
2005
Springer
14 years 14 days ago
Representing Probabilistic Relations in RDF
Probabilistic inference will be of special importance when one needs to know how much we can say with what all we know given new observations. Bayesian Network is a graphical prob...
Yoshio Fukushige
ICASSP
2011
IEEE
12 years 10 months ago
An evaluation of noise power spectral density estimation algorithms in adverse acoustic environments
Noise power spectral density estimation is an important component of speech enhancement systems due to its considerable effect on the quality and the intelligibility of the enhanc...
Jalal Taghia, Jalil Taghia, Nasser Mohammadiha, Ji...
KDD
2003
ACM
175views Data Mining» more  KDD 2003»
14 years 7 months ago
Time and sample efficient discovery of Markov blankets and direct causal relations
Data Mining with Bayesian Network learning has two important characteristics: under broad conditions learned edges between variables correspond to causal influences, and second, f...
Ioannis Tsamardinos, Constantin F. Aliferis, Alexa...
CORR
2010
Springer
97views Education» more  CORR 2010»
13 years 7 months ago
Analysis of a Splitting Estimator for Rare Event Probabilities in Jackson Networks
We consider a standard splitting algorithm for the rare-event simulation of overflow probabilities in any subset of stations in a Jackson network at level n, starting at a fixed i...
Jose Blanchet, Kevin Leder, Yixi Shi
CORR
2008
Springer
103views Education» more  CORR 2008»
13 years 7 months ago
Path Loss Exponent Estimation in Large Wireless Networks
In wireless channels, the path loss exponent (PLE) has a strong impact on the quality of the links, and hence, it needs to be accurately estimated for the efficient design and oper...
Sunil Srinivasa, Martin Haenggi