Sciweavers

2137 search results - page 40 / 428
» Proving Abstract Non-interference
Sort
View
115
Voted
MOC
2011
14 years 9 months ago
Error estimates for Raviart-Thomas interpolation of any order on anisotropic tetrahedra
Abstract. We prove optimal order error estimates for the Raviart-Thomas interpolation of arbitrary order under the maximum angle condition for triangles and under two generalizatio...
Gabriel Acosta, Thomas Apel, Ricardo G. Durá...
132
Voted
TWC
2010
14 years 9 months ago
Maximum-likelihood noncoherent OSTBC detection with polynomial complexity
Abstract--We prove that maximum-likelihood (ML) noncoherent sequence detection of orthogonal space-time block coded signals can always be performed in polynomial time with respect ...
Dimitris S. Papailiopoulos, George N. Karystinos
149
Voted
CP
2011
Springer
14 years 2 months ago
Optimal Carpet Cutting
Abstract. In this paper we present a model for the carpet cutting problem in which carpet shapes are cut from a rectangular carpet roll with a fixed width and sufficiently long le...
Andreas Schutt, Peter J. Stuckey, Andrew R. Verden
KBSE
1999
IEEE
15 years 6 months ago
Modular and Incremental Analysis of Concurrent Software Systems
Modularization and abstraction are the keys to practical verification and analysis of large and complex systems. We present in an incremental methodology for the automatic analysi...
Hassen Saïdi
CORR
2007
Springer
77views Education» more  CORR 2007»
15 years 2 months ago
On the interaction between sharing and linearity
nalysis of logic programs, abstract domains for detecting sharing and linearity ion are widely used. Devising abstract unification algorithms for such domains has proved to be ra...
Gianluca Amato, Francesca Scozzari