Sciweavers

12 search results - page 2 / 3
» A feasible algorithm for typing in Elementary Affine Logic
Sort
View
CORR
2010
Springer
153views Education» more  CORR 2010»
13 years 5 months ago
Towards Parameterized Regular Type Inference Using Set Constraints
We propose a method for inferring parameterized regular types for logic programs as solutions for systems of constraints over sets of finite ground Herbrand terms (set constraint s...
Francisco Bueno, Jorge A. Navas, Manuel V. Hermene...
FINTAL
2006
13 years 8 months ago
Discourse Segmentation of German Written Texts
Abstract. Discourse segmentation is the division of a text into minimal discourse segments, which form the leaves in the trees that are used to represent discourse structures. A de...
Harald Lüngen, Csilla Puskás, Maja B&a...
SAC
2002
ACM
13 years 4 months ago
Location adjustment for the minimum volume ellipsoid estimator
Estimating multivariate location and scatter with both affine equivariance and positive breakdown has always been difficult. A well-known estimator which satisfies both properties...
Christophe Croux, Gentiane Haesbroeck, Peter J. Ro...
FPGA
1998
ACM
132views FPGA» more  FPGA 1998»
13 years 9 months ago
Circuit Partitioning with Complex Resource Constraints in FPGAs
In this paper, we present an algorithm for circuit partitioning with complex resource constraints in large FPGAs. Traditional partitioning methods estimate the capacity of an FPGA...
Huiqun Liu, Kai Zhu, D. F. Wong
POPL
2003
ACM
14 years 5 months ago
Static prediction of heap space usage for first-order functional programs
We show how to efficiently obtain linear a priori bounds on the heap space consumption of first-order functional programs. The analysis takes space reuse by explicit deallocation ...
Martin Hofmann, Steffen Jost