Sciweavers

108 search results - page 10 / 22
» User-Definable Resource Bounds Analysis for Logic Programs
Sort
View
ENTCS
2006
105views more  ENTCS 2006»
13 years 6 months ago
Feasible Reactivity for Synchronous Cooperative Threads
We are concerned with programs composed of cooperative threads whose execution proceeds in synchronous rounds called instants. We develop static analysis methods to guarantee that...
Roberto M. Amadio, Frédéric Dabrowsk...
CVPR
2006
IEEE
14 years 8 months ago
Reconstruction with Interval Constraints Propagation
In this paper we demonstrate how Interval Analysis and Constraint Logic Programming can be used to obtain an accurate geometric model of a scene that rigorously takes into account...
Michela Farenzena, Andrea Fusiello, Agostino Dovie...
NJC
2000
169views more  NJC 2000»
13 years 6 months ago
A Type System for Bounded Space and Functional In-Place Update
We show how linear typing can be used to obtain functional programs which modify heap-allocated data structures in place. We present this both as a "design pattern" for ...
Martin Hofmann
KDD
2009
ACM
202views Data Mining» more  KDD 2009»
14 years 7 months ago
Correlated itemset mining in ROC space: a constraint programming approach
Correlated or discriminative pattern mining is concerned with finding the highest scoring patterns w.r.t. a correlation measure (such as information gain). By reinterpreting corre...
Siegfried Nijssen, Tias Guns, Luc De Raedt
AGP
2003
IEEE
14 years 13 hour ago
Time Equations for Lazy Functional (Logic) Languages
There are very few approaches to measure the execution costs of lazy functional (logic) programs. The use of a lazy execution mechanism implies that the complexity of an evaluation...
Elvira Albert, Josep Silva, Germán Vidal