Sciweavers

9405 search results - page 12 / 1881
» Computing a Model of Set Theory
Sort
View
HIS
2003
14 years 11 months ago
On a Set Theory With Uncertain Membership Relations
We logically model uncertainty by expanding language without changing logical reasoning rules. We expand the language of set theory by adding new predicate symbols, uncertain membe...
Shunsuke Yatabe, Yuzuru Kakuda, Makoto Kikuchi
MOBIHOC
2008
ACM
15 years 9 months ago
An O(log n) dominating set protocol for wireless ad-hoc networks under the physical interference model
Dealing with interference is one of the primary challenges to solve in the design of protocols for wireless ad-hoc networks. Most of the work in the literature assumes localized o...
Christian Scheideler, Andréa W. Richa, Paol...
CIKM
1997
Springer
15 years 1 months ago
Learning Belief Networks from Data: An Information Theory Based Approach
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...
Jie Cheng, David A. Bell, Weiru Liu
JMLR
2010
92views more  JMLR 2010»
14 years 4 months ago
Posterior distributions are computable from predictive distributions
As we devise more complicated prior distributions, will inference algorithms keep up? We highlight a negative result in computable probability theory by Ackerman, Freer, and Roy (...
Cameron E. Freer, Daniel M. Roy
SEC
1996
14 years 11 months ago
Intention modelling: approximating computer user intentions for detection and prediction of intrusions
This paper introduces and describes an innovative modelling approach which utilises models that are synthesised through approximate calculations of user actions and extensive repr...
Thomas Spyrou, John Darzentas