Sciweavers

4767 search results - page 385 / 954
» Structures for Abstract Rewriting
Sort
View
SAS
2010
Springer
141views Formal Methods» more  SAS 2010»
15 years 5 months ago
Statically Inferring Complex Heap, Array, and Numeric Invariants
We describe Deskcheck, a parametric static analyzer that is able to establish properties of programs that manipulate dynamically allocated memory, arrays, and integers. Deskcheck c...
Bill McCloskey, Thomas W. Reps, Mooly Sagiv
ECCV
2008
Springer
16 years 8 months ago
Solving Image Registration Problems Using Interior Point Methods
Abstract. This paper describes a novel approach to recovering a parametric deformation that optimally registers one image to another. The method proceeds by constructing a global c...
Camillo J. Taylor, Arvind Bhusnurmath
WWW
2004
ACM
16 years 7 months ago
Surfing the web by site
We provide a system for surfing the web at a high level of abstraction, which is an analogy of the web browser, but which displays entire sites at a time. It allows a principled i...
David Gibson
ALT
2004
Springer
16 years 3 months ago
Hidden Markov Modelling Techniques for Haplotype Analysis
Abstract. A hidden Markov model is introduced for descriptive modelling the mosaic–like structures of haplotypes, due to iterated recombinations within a population. Methods usin...
Mikko Koivisto, Teemu Kivioja, Heikki Mannila, Pas...
WADS
2009
Springer
256views Algorithms» more  WADS 2009»
16 years 1 months ago
Dynamic Graph Clustering Using Minimum-Cut Trees
Abstract. Algorithms or target functions for graph clustering rarely admit quality guarantees or optimal results in general. Based on properties of minimum-cut trees, a clustering ...
Robert Görke, Tanja Hartmann, Dorothea Wagner