Sciweavers

1300 search results - page 177 / 260
» Probabilistic logic with independence
Sort
View
JCST
2010
189views more  JCST 2010»
13 years 2 months ago
Formally Analyzing Expected Time Complexity of Algorithms Using Theorem Proving
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
Osman Hasan, Sofiène Tahar
NC
2008
122views Neural Networks» more  NC 2008»
13 years 7 months ago
Computation with finite stochastic chemical reaction networks
A highly desired part of the synthetic biology toolbox is an embedded chemical microcontroller, capable of autonomously following a logic program specified by a set of instructions...
David Soloveichik, Matthew Cook, Erik Winfree, Jeh...
SYNTHESE
2008
131views more  SYNTHESE 2008»
13 years 7 months ago
A new formulation of the Principle of Indifference
This article goes to the foundations of Statistical Inference through a review of Carnap's logic theory of induction. From this point of view, it brings another solution to t...
Rodolfo de Cristofaro
KDD
2003
ACM
149views Data Mining» more  KDD 2003»
14 years 8 months ago
Knowledge-based data mining
We describe techniques for combining two types of knowledge systems: expert and machine learning. Both the expert system and the learning system represent information by logical d...
Søren Damgaard, Sholom M. Weiss, Shubir Kap...
AAAI
2010
13 years 9 months ago
Recognizing Multi-Agent Activities from GPS Data
Recent research has shown that surprisingly rich models of human behavior can be learned from GPS (positional) data. However, most research to date has concentrated on modeling si...
Adam Sadilek, Henry A. Kautz