Sciweavers

749 search results - page 101 / 150
» Combinatory Models and Symbolic Computation
Sort
View
ENTCS
2002
139views more  ENTCS 2002»
13 years 10 months ago
Automatic Verification of the IEEE-1394 Root Contention Protocol with KRONOS and PRISM
We report on the automatic verification of timed probabilistic properties of the IEEE 1394 root contention protocol combining two existing tools: the real-time modelchecker Kronos...
Conrado Daws, Marta Z. Kwiatkowska, Gethin Norman
FOCS
2006
IEEE
14 years 4 months ago
A simple condition implying rapid mixing of single-site dynamics on spin systems
Spin systems are a general way to describe local interactions between nodes in a graph. In statistical mechanics, spin systems are often used as a model for physical systems. In c...
Thomas P. Hayes
DATAMINE
2010
175views more  DATAMINE 2010»
13 years 10 months ago
Extracting influential nodes on a social network for information diffusion
We address the combinatorial optimization problem of finding the most influential nodes on a large-scale social network for two widely-used fundamental stochastic diffusion models...
Masahiro Kimura, Kazumi Saito, Ryohei Nakano, Hiro...
NIPS
2001
13 years 11 months ago
Constructing Distributed Representations Using Additive Clustering
If the promise of computational modeling is to be fully realized in higherlevel cognitive domains such as language processing, principled methods must be developed to construct th...
Wheeler Ruml
RECOMB
2002
Springer
14 years 10 months ago
From promoter sequence to expression: a probabilistic framework
We present a probabilistic framework that models the process by which transcriptional binding explains the mRNA expression of different genes. Our joint probabilistic model unifie...
Eran Segal, Yoseph Barash, Itamar Simon, Nir Fried...