632 search results - page 59 / 127 » Proving Invariants of Functional Programs |
CORR
2008
Springer
15 years 20 days ago
2008
Springer
We reprove that the approximate degree of the OR function on n bits is ( n). We consider a linear program which is feasible if and only if there is an approximate polynomial for ...
110
click to vote
ECCV
2008
Springer
16 years 2 months ago
2008
Springer
Abstract. We propose a novel method for action detection based on a new action descriptor called a shape flow that represents both the shape and movement of an object in a holistic...
103
click to vote
POPL
2010
ACM
15 years 10 months ago
2010
ACM
We present an analysis to automatically determine if a program represents a continuous function, or equivalently, if infinitesimal changes to its inputs can only cause infinitesim...
101
Voted
DAM
1998
15 years 8 days ago
1998
We first consider so-called (1,+s)-branching programs in which along every consistent path at most s variables are tested more than once. We prove that any such program computing...
131
click to vote
AC
2000
Springer
15 years 5 months ago
2000
Springer
In these notes, we give an overview of the join calculus, its semantics, and its equational theory. The join calculus is a language that models distributed and mobile programming. ...