675 search results - page 1 / 135 » Algorithms for estimating relative importance in networks |
KDD
2003
ACM
14 years 5 months ago
2003
ACM
Large and complex graphs representing relationships among sets of entities are an increasingly common focus of interest in data analysis--examples include social networks, Web gra...
QUESTA
2007
13 years 4 months ago
2007
Efficient estimation of tail probabilities involving heavy tailed random variables is amongst the most challenging problems in Monte-Carlo simulation. In the last few years, appli...
AI
2007
Springer
13 years 11 months ago
2007
Springer
Importance sampling-based algorithms are a popular alternative when Bayesian network models are too large or too complex for exact algorithms. However, importance sampling is sensi...
ICRA
2009
IEEE
13 years 11 months ago
2009
IEEE
— Relative bearing between robots is important in applications like pursuit-evasion [11] and SLAM [7]. This is also true in in sensor networks, where the bearing of one sensor no...
ETT
2002
13 years 4 months ago
2002
In this paper, a method is presented for the efficient estimation of rare-event (buffer overflow) probabilities in queueing networks using importance sampling. Unlike previously pr...