268 search results - page 14 / 54 » Recursion Theoretic Operators for Function Complexity Classe... |
124
click to vote
ICCV
1999
IEEE
15 years 10 months ago
1999
IEEE
We present an algorithm that extracts curves from a set of edgels within a specific class in a decreasing order of their ``length''. The algorithm inherits the perceptual...
EOR
2008
14 years 9 months ago
2008
We review complexity results for minimizing polynomials over the standard simplex and unit hypercube. In addition, we derive new results on the computational complexity of approxi...
NJC
2000
14 years 9 months ago
2000
We show how linear typing can be used to obtain functional programs which modify heap-allocated data structures in place. We present this both as a "design pattern" for ...
67
Voted
ENTCS
2007
14 years 9 months ago
2007
The implementation of conceptually continuous signals in functional reactive programming (FRP) is studied in detail. We show that recursive signals in standard implementations usi...
107
click to vote
FOSSACS
2007
Springer
15 years 1 months ago
2007
Springer
In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of tempora...