Sciweavers

631 search results - page 121 / 127
» Deriving Specifications from Requirements: An Example
Sort
View
POPL
2006
ACM
14 years 7 months ago
Verifying properties of well-founded linked lists
We describe a novel method for verifying programs that manipulate linked lists, based on two new predicates that characterize reachability of heap cells. These predicates allow re...
Shuvendu K. Lahiri, Shaz Qadeer
ICNP
2007
IEEE
14 years 1 months ago
A Probabilistic Coverage Protocol for Wireless Sensor Networks
—We propose a new probabilistic coverage protocol (denoted by PCP) that considers probabilistic sensing models. PCP is fairly general and can be used with different sensing model...
Mohamed Hefeeda, Hossein Ahmadi
PG
2007
IEEE
14 years 29 days ago
Genus Oblivious Cross Parameterization: Robust Topological Management of Inter-Surface Maps
We consider the problem of generating a map between two triangulated meshes, M and M’, with arbitrary and possibly differing genus. This problem has rarely been tackled in its g...
Janine Bennett, Valerio Pascucci, Kenneth I. Joy
CCA
2009
Springer
13 years 10 months ago
Effective Choice and Boundedness Principles in Computable Analysis
Abstract. In this paper we study a new approach to classify mathematical theorems according to their computational content. Basically, we are asking the question which theorems can...
Vasco Brattka, Guido Gherardi
CVPR
2009
IEEE
15 years 1 months ago
Learning To Detect Unseen Object Classes by Between-Class Attribute Transfer
We study the problem of object classification when training and test classes are disjoint, i.e. no training examples of the target classes are available. This setup has hardly be...
Christoph H. Lampert, Hannes Nickisch, Stefan Harm...