Sciweavers

94 search results - page 3 / 19
» On Probabilistic Time versus Alternating Time
Sort
View
ICASSP
2011
IEEE
13 years 21 days ago
Content preference estimation in online social networks: Message passing versus sparse reconstruction on graphs
We design two different strategies for computing the unknown content preferences in an online social network based on a small set of nodes in the corresponding social graph for wh...
Jacob Chakareski
BMCBI
2010
110views more  BMCBI 2010»
13 years 9 months ago
TimeDelay-ARACNE: Reverse engineering of gene networks from time-course data by an information theoretic approach
Background: One of main aims of Molecular Biology is the gain of knowledge about how molecular components interact each other and to understand gene function regulations. Using mi...
Pietro Zoppoli, Sandro Morganella, Michele Ceccare...
ENTCS
2006
119views more  ENTCS 2006»
13 years 9 months ago
Trace Machines for Observing Continuous-Time Markov Chains
In this paper, we study several linear-time equivalences (Markovian trace equivalence, failure and ready trace equivalence) for continuous-time Markov chains that refer to the pro...
Verena Wolf, Christel Baier, Mila E. Majster-Ceder...
ICLP
2005
Springer
14 years 2 months ago
Hybrid Probabilistic Logic Programs with Non-monotonic Negation
1 In [20], a new Hybrid Probabilistic Logic Programs framework is proposed, and a new semantics is developed to enable encoding and reasoning about real-world applications. In this...
Emad Saad, Enrico Pontelli
COLT
2008
Springer
13 years 10 months ago
Learning Acyclic Probabilistic Circuits Using Test Paths
We define a model of learning probabilistic acyclic circuits using value injection queries, in which an arbitrary subset of wires is set to fixed values, and the value on the sing...
Dana Angluin, James Aspnes, Jiang Chen, David Eise...