1561 search results - page 77 / 313 » Probability Theory on IF Events |
CIKM
1997
Springer
15 years 2 months ago
1997
Springer
This paper presents an efficient algorithm for learning Bayesian belief networks from databases. The algorithm takes a database as input and constructs the belief network structur...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
In wireless networks, the knowledge of nodal distances is essential for performance analysis and protocol design. When determining distance distributions in random networks, the u...
AIPS
2009
14 years 11 months ago
2009
We define the robustness of a sequential plan as the probability that it will execute successfully despite uncertainty in the execution environment. We consider a rich notion of u...
IJSNET
2008
14 years 9 months ago
2008
: Coverage is an important optimization objective in pre and post-deployment stage of a Wireless Sensor Network (WSN). In this paper, we address the issue of placing a finite set o...
PAKDD
2010
ACM
15 years 2 months ago
2010
ACM
Abstract. Discovering interesting patterns in long sequences, and finding confident association rules within them, is a popular area in data mining. Most existing methods define...