5084 search results - page 424 / 1017 » Proving Possibility Properties |
166
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
Abstract. A Boolean function on N variables is called evasive if its decision-tree complexity is N. A sequence Bn of Boolean functions is eventually evasive if Bn is evasive for al...
189
click to vote
HYBRID
2010
Springer
15 years 12 months ago
2010
Springer
NetSketch is a tool for the specification of constrained-flow applications and the certification of desirable safety properties imposed thereon. NetSketch assists system integr...
189
click to vote
SIAMCOMP
2008
15 years 6 months ago
2008
The Graph Theorem of classical recursion theory states that a total function on the natural numbers is computable, if and only if its graph is recursive. It is known that this res...
157
click to vote
MOC
2010
15 years 1 months ago
2010
Abstract. Multiwavelets and multiframelets are of interest in several applications such as numerical algorithms and signal processing, due to their desirable properties such as hig...
178
click to vote
SIAMMA
2010
15 years 1 months ago
2010
In recent work nonlinear subdivision schemes which operate on manifold-valued data have been successfully analyzed with the aid of so-called proximity conditions bounding the diffe...