Sciweavers

72 search results - page 10 / 15
» Two Kinds of Probabilistic Induction
Sort
View
DEXAW
2004
IEEE
132views Database» more  DEXAW 2004»
15 years 1 months ago
Using Data-Flow Analysis for Resilience and Result Checking in Peer-To-Peer Computations
To achieve correct execution of peer-to-peer applications on non-reliable resources, we present a portable and distributed algorithm that provides fault tolerance and result checki...
Samir Jafar, Sébastien Varrette, Jean-Louis...
ENTCS
2010
103views more  ENTCS 2010»
14 years 6 months ago
A Model and Analysis of the AKAP Scaffold
We study the biochemical processes involved in scaffold-mediated crosstalk between the cAMP and the Raf-1/MEK/ERK pathways. We model the system by a continuous time Markov chain w...
Oana Andrei, Muffy Calder
WG
1993
Springer
15 years 1 months ago
Graphs, Hypergraphs and Hashing
Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algori...
George Havas, Bohdan S. Majewski, Nicholas C. Worm...
77
Voted
IJCAI
1989
14 years 10 months ago
A Study of Empirical Learning for an Involved Problem
In real-world domains a concept to be learned may be unwieldy and the environment may be less than ideal. One combination of difficulties occurs if the concept is probabilistic an...
Larry A. Rendell
SDM
2010
SIAM
158views Data Mining» more  SDM 2010»
14 years 11 months ago
On the Use of Combining Rules in Relational Probability Trees
A relational probability tree (RPT) is a type of decision tree that can be used for probabilistic classification of instances with a relational structure. Each leaf of an RPT cont...
Daan Fierens