Sciweavers

1351 search results - page 37 / 271
» An Analysis of Inference with the Universum
Sort
View
ESOP
1994
Springer
15 years 1 months ago
Local Type Reconstruction by Means of Symbolic Fixed Point Iteration
Abstract. We convert, via a version that uses constraints, a type inference system for strictness analysis into an algorithm which given an expression finds the set of possible typ...
Torben Amtoft
FM
2009
Springer
123views Formal Methods» more  FM 2009»
15 years 4 months ago
"Carbon Credits" for Resource-Bounded Computations Using Amortised Analysis
Abstract. Bounding resource usage is important for a number of areas, notably real-time embedded systems and safety-critical systems. In this paper, we present a fully automatic st...
Steffen Jost, Hans-Wolfgang Loidl, Kevin Hammond, ...
ISBI
2009
IEEE
15 years 4 months ago
Probabilistic Branching Node Detection Using Hybrid Local Features
Probabilistic branching node inference is an important step for analyzing branching patterns involved in many anatomic structures. We propose combining machine learning techniques...
Haibin Ling, Michael Barnathan, Vasileios Megalooi...
CONCUR
2006
Springer
15 years 1 months ago
A New Type System for Deadlock-Free Processes
We extend a previous type system for the -calculus that guarantees deadlock-freedom. The previous type systems for deadlockfreedom either lacked a reasonable type inference algorit...
Naoki Kobayashi
CVPR
2007
IEEE
15 years 11 months ago
Generative Graphical Models for Maneuvering Object Tracking and Dynamics Analysis
We study the challenging problem of maneuvering object tracking with unknown dynamics, i.e., forces or torque. We investigate the underlying causes of object kinematics, and propo...
Xin Fan, Guoliang Fan