Sciweavers

1847 search results - page 147 / 370
» Hybrid Functional Interpretations
Sort
View
JANCL
2002
90views more  JANCL 2002»
15 years 5 months ago
A Topological Constraint Language with Component Counting
A topological constraint language is a formal language whose variables range over certain subsets of topological spaces, and whose nonlogical primitives are interpreted as topologi...
Ian Pratt-Hartmann
ICML
2004
IEEE
16 years 6 months ago
Relational sequential inference with reliable observations
We present a trainable sequential-inference technique for processes with large state and observation spaces and relational structure. Our method assumes "reliable observation...
Alan Fern, Robert Givan
ICASSP
2011
IEEE
14 years 9 months ago
Fast adaptive variational sparse Bayesian learning with automatic relevance determination
In this work a new adaptive fast variational sparse Bayesian learning (V-SBL) algorithm is proposed that is a variational counterpart of the fast marginal likelihood maximization ...
Dmitriy Shutin, Thomas Buchgraber, Sanjeev R. Kulk...
161
Voted
PEPM
1993
ACM
15 years 10 months ago
The Correctness of an Optimized Code Generation
For a functional programming language with a lazy standard semantics, we define a strictness analysis by means of abstract interpretation. Using the information from the strictne...
Torben Poort Lange
LICS
1997
IEEE
15 years 9 months ago
Automata, Tableaus and a Reduction Theorem for Fixpoint Calculi in Arbitrary Complete Lattices
Fixpoint expressions built from functional signatures interpreted over arbitrary complete lattices are considered. A generic notionof automatonis defined and shown, by means of a ...
David Janin