2333 search results - page 110 / 467 » Recursive Computational Depth |
SCN
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. Lattice reduction is known to be a very powerful tool in modern cryptanalysis. In the literature, there are many lattice reduction algorithms that have been proposed with...
SAS
1999
Springer
14 years 1 months ago
1999
Springer
This paper describes a powerful method for dead code analysis and elimination in the presence of recursive data constructions. We describe partially dead recursive data using live...
TSP
2010
13 years 4 months ago
2010
The adaptive estimation of a time-varying parameter vector in a linear Gaussian model is considered where we a priori know that the parameter vector belongs to a known arbitrary s...
FOSSACS
2010
Springer
14 years 4 months ago
2010
Springer
Final coalgebras for a functor serve as semantic domains for state based systems of various types. For example, formal languages, streams, nonwell-founded sets and behaviors of CCS...
FOSSACS
2009
Springer
14 years 4 months ago
2009
Springer
Higher-order recursion schemes are systems of rewrite rules on typed non-terminal symbols, which can be used to define infinite trees. The Global Modal Mu-Calculus Model Checking...