Sciweavers

4469 search results - page 43 / 894
» Dynamic Program Slicing
Sort
View
SLP
1997
89views more  SLP 1997»
13 years 9 months ago
Program Analysis via Graph Reachability
This paper describes how a number of program-analysis problems can be solved by transforming them to graph-reachability problems. Some of the program-analysis problems that are am...
Thomas W. Reps
CTCS
1995
Springer
13 years 11 months ago
A Proposed Categorical Semantics for ML Modules
We present a simple categorical semantics for ML signatures, structures and functors. Our approach relies on realizablity semantics in the category of assemblies. Signatures and s...
Michael P. Fourman, Hayo Thielecke
ICASSP
2011
IEEE
12 years 11 months ago
A general Bayesian algorithm for visual object tracking based on sparse features
This paper describes a Bayesian algorithm for rigid/non-rigid 2D visual object tracking based on sparse image features. The algorithm is inspired by the way human visual cortex se...
Mauricio Soto Alvarez, Carlo S. Regazzoni
ISBI
2004
IEEE
14 years 8 months ago
Phase-Correlated Dynamic CT
Phase?correlated CT is the measurement of an organ that exhibits quasi?periodic motion. Dedicated image reconstruction algorithms utilize only those data ranges that have been acq...
Marc Kachelriess
UAI
2003
13 years 9 months ago
On Triangulating Dynamic Graphical Models
This paper introduces improved methodology to triangulate dynamic graphical models and dynamic Bayesian networks (DBNs). In this approach, a standard DBN template can be modified...
Jeff A. Bilmes, Chris Bartels