Sciweavers

5378 search results - page 295 / 1076
» Base Logics in Argumentation
Sort
View
JMLR
2010
95views more  JMLR 2010»
15 years 1 months ago
Feature Extraction for Machine Learning: Logic-Probabilistic Approach
The paper analyzes peculiarities of preprocessing of learning data represented in object data bases constituted by multiple relational tables with ontology on top of it. Exactly s...
Vladimir Gorodetsky, Vladimir Samoilov
ICML
1999
IEEE
16 years 7 months ago
Abstracting from Robot Sensor Data using Hidden Markov Models
ing from Robot Sensor Data using Hidden Markov Models Laura Firoiu, Paul Cohen Computer Science Department, LGRC University of Massachusetts at Amherst, Box 34610 Amherst, MA 01003...
Laura Firoiu, Paul R. Cohen
ICALP
2009
Springer
16 years 7 months ago
High Complexity Tilings with Sparse Errors
Abstract. Tile sets and tilings of the plane appear in many topics ranging from logic (the Entscheidungsproblem) to physics (quasicrystals). The idea is to enforce some global prop...
Bruno Durand, Andrei E. Romashchenko, Alexander Sh...
IWMM
2009
Springer
122views Hardware» more  IWMM 2009»
16 years 1 months ago
Parametric heap usage analysis for functional programs
This paper presents an analysis that derives a formula describing the worst-case live heap space usage of programs in a functional language with automated memory management (garba...
Leena Unnikrishnan, Scott D. Stoller
TPHOL
2008
IEEE
16 years 1 months ago
A Type of Partial Recursive Functions
We describe a new method to represent (partial) recursive functions in type theory. For every recursive definition, we define a co-inductive type of prophecies that characterises...
Ana Bove, Venanzio Capretta