595 search results - page 68 / 119 » Using Constraints with Memory to Implement Variable Eliminat... |
110
click to vote
ICSE
2000
IEEE-ACM
15 years 7 months ago
2000
IEEE-ACM
Explicitly stated program invariants can help programmers by characterizing certain aspects of program execution and identifying program properties that must be preserved when mod...
137
Voted
CAV
2011
Springer
14 years 7 months ago
2011
Springer
Abstract. Many automatic testing, analysis, and verification techniques for programs can effectively be reduced to a constraint-generation phase followed by a constraint-solving ...
196
Voted
CVPR
2012
IEEE
13 years 5 months ago
2012
IEEE
We recast the Cosegmentation problem using Random Walker (RW) segmentation as the core segmentation algorithm, rather than the traditional MRF approach adopted in the literature s...
133
click to vote
IFIP
2005
Springer
15 years 8 months ago
2005
Springer
A new quasi-Newton scheme for updating a low rank positive semi-definite Hessian approximation is described, primarily for use in sequential quadratic programming methods for non...
136
click to vote
AADEBUG
1997
Springer
15 years 7 months ago
1997
Springer
We introduce an assertion language for run-time checking of linked list data structure shapes. The assertion language is expressive enough to define characteristic predicates for ...