3691 search results - page 321 / 739 » Bayesian Logic Programs |
315
click to vote
ICFP
2009
ACM
16 years 7 months ago
2009
ACM
We present a new approach for constructing and verifying higherorder, imperative programs using the Coq proof assistant. We build on the past work on the Ynot system, which is bas...
165
click to vote
ICIP
2001
IEEE
16 years 8 months ago
2001
IEEE
In this paper we describe integrated multimedia processing for Video Scout, a system that segments and indexes TV programs according to their audio, visual, and transcript informa...
189
click to vote
ICFP
2008
ACM
16 years 6 months ago
2008
ACM
We describe an axiomatic extension to the Coq proof assistant, that supports writing, reasoning about, and extracting higher-order, dependently-typed programs with side-effects. C...
193
click to vote
JASIS
2000
15 years 6 months ago
2000
s In data mining, we emphasize the need for learning from huge, incomplete and imperfect data sets (Fayyad et al. 1996, Frawley et al. 1991, Piatetsky-Shapiro and Frawley, 1991). T...
261
Voted
PSSE
2004
Springer
16 years 3 days ago
2004
Springer
“demonic” nondeterminism, representing abstraction from (or ignorance of) which of two program fragments will be executed. By introducing probabilistic nondeterminism into GCL,...