Sciweavers

691 search results - page 64 / 139
» Automatically Proving Linearizability
Sort
View
AAECC
2005
Springer
128views Algorithms» more  AAECC 2005»
13 years 10 months ago
The size-change principle and dependency pairs for termination of term rewriting
Abstract In [24], a new size-change principle was proposed to verify termination of functional programs automatically. We extend this principle in order to prove termination and in...
René Thiemann, Jürgen Giesl
RV
2010
Springer
122views Hardware» more  RV 2010»
13 years 8 months ago
Clara: A Framework for Partially Evaluating Finite-State Runtime Monitors Ahead of Time
Researchers have developed a number of runtime verification tools that generate runtime monitors in the form of AspectJ aspects. In this work, we present Clara, a novel framework ...
Eric Bodden, Patrick Lam, Laurie J. Hendren
CVPR
1998
IEEE
14 years 12 months ago
Making Good Features Track Better
This paper addresses robust feature tracking. We extend the well-known Shi-Tomasi-Kanade tracker by introducing an automatic scheme for rejecting spurious features. We employ a si...
Tiziano Tommasini, Andrea Fusiello, Emanuele Trucc...
ICIP
2005
IEEE
14 years 11 months ago
Lung nodules detection and classification
Image processing techniques and Computer Aided Diagnosis (CAD) systems have proved to be effective for the improvement of radiologists' diagnosis. In this paper an automatic ...
Paola Campadelli, Elena Casiraghi, Giorgio Valenti...
ICIP
1999
IEEE
14 years 11 months ago
Deformable Matching of Hand Shapes for User Verification
Wepresent a method for personal authentication based on deformable matching of hand shapes. Authentication systems are already employed in domains that require some sort of user v...
Anil K. Jain, Nicolae Duta