Sciweavers

258 search results - page 35 / 52
» Relational Correspondences for Lattices with Operators
Sort
View
POPL
2010
ACM
14 years 4 months ago
Counterexample-Guided Focus
The automated inference of quantified invariants is considered one of the next challenges in software verification. The question of the right precision-efficiency tradeoff for the...
Andreas Podelski, Thomas Wies
BMCBI
2007
106views more  BMCBI 2007»
13 years 7 months ago
Constructing a meaningful evolutionary average at the phylogenetic center of mass
Background: As a consequence of the evolutionary process, data collected from related species tend to be similar. This similarity by descent can obscure subtler signals in the dat...
Eric A. Stone, Arend Sidow
CVPR
2010
IEEE
14 years 4 months ago
Scalable Active Matching
In matching tasks in computer vision, and particularly in real-time tracking from video, there are generally strong priors available on absolute and relative correspondence locati...
Ankur Handa, Margarita Chli, Hauke Strasdat, Andre...
POPL
2007
ACM
14 years 7 months ago
Generative unbinding of names
This paper is concerned with a programming language construct for typed name binding that enforces -equivalence. It proves a new result about what operations on names can co-exist...
Andrew M. Pitts, Mark R. Shinwell
CIE
2010
Springer
13 years 7 months ago
Computable Ordered Abelian Groups and Fields
Abstract. We present transformations of linearly ordered sets into ordered abelian groups and ordered fields. We study effective properties of the transformations. In particular, w...
Alexander G. Melnikov