Sciweavers

1592 search results - page 93 / 319
» On the Equality of Probabilistic Terms
Sort
View
SIGMOD
2011
ACM
250views Database» more  SIGMOD 2011»
14 years 23 days ago
Hybrid in-database inference for declarative information extraction
In the database community, work on information extraction (IE) has centered on two themes: how to effectively manage IE tasks, and how to manage the uncertainties that arise in th...
Daisy Zhe Wang, Michael J. Franklin, Minos N. Garo...
LICS
2007
IEEE
15 years 4 months ago
Higher-Order Matching, Games and Automata
Higher-order matching is the problem given t = u where t, u are terms of simply typed λ-calculus and u is closed, is there a substitution θ such that tθ and u have the same nor...
Colin Stirling
GECCO
2009
Springer
101views Optimization» more  GECCO 2009»
15 years 4 months ago
Modeling UCS as a mixture of experts
We present a probabilistic formulation of UCS (a sUpervised Classifier System). UCS is shown to be a special case of mixture of experts where the experts are learned independentl...
Narayanan Unny Edakunni, Tim Kovacs, Gavin Brown, ...
SIGIR
2009
ACM
15 years 4 months ago
Counting ancestors to estimate authority
The AncestorRank algorithm calculates an authority score by using just one characteristic of the web graph—the number of ancestors per node. For scalability, we estimate the num...
Jian Wang, Brian D. Davison
CONCUR
2007
Springer
15 years 4 months ago
Making Random Choices Invisible to the Scheduler
Abstract. When dealing with process calculi and automata which express both nondeterministic and probabilistic behavior, it is customary to introduce the notion of scheduler to res...
Konstantinos Chatzikokolakis, Catuscia Palamidessi