Sciweavers

2629 search results - page 361 / 526
» complex 2009
Sort
View
FCT
2009
Springer
15 years 11 months ago
Small-Space Analogues of Valiant's Classes
In the uniform circuit model of computation, the width of a boolean circuit exactly characterises the “space” complexity of the computed function. Looking for a similar relatio...
Meena Mahajan, B. V. Raghavendra Rao
FIMH
2009
Springer
15 years 11 months ago
Maximum Likelihood Motion Estimation in 3D Echocardiography through Non-rigid Registration in Spherical Coordinates
Automated motion tracking of the myocardium from 3D echocardiography provides insight into heart’s architecture and function. We present a method for 3D cardiac motion tracking u...
Andriy Myronenko, Xubo B. Song, David J. Sahn
FM
2009
Springer
110views Formal Methods» more  FM 2009»
15 years 11 months ago
Reduced Execution Semantics of MPI: From Theory to Practice
Abstract: There is growing need to develop formal verification tools for Message Passing Interface (MPI) programs, to eliminate bugs such as deadlocks and local assertion violatio...
Sarvani S. Vakkalanka, Anh Vo, Ganesh Gopalakrishn...
FMCAD
2009
Springer
15 years 11 months ago
Scaling VLSI design debugging with interpolation
—Given an erroneous design, functional verification returns an error trace exhibiting a mismatch between the specification and the implementation of a design. Automated design ...
Brian Keng, Andreas G. Veneris
137
Voted
FSTTCS
2009
Springer
15 years 11 months ago
Modelchecking counting properties of 1-safe nets with buffers in paraPSPACE
ABSTRACT. We consider concurrent systems that can be modelled as 1-safe Petri nets communicating through a fixed set of buffers (modelled as unbounded places). We identify a param...
M. Praveen, Kamal Lodaya