Sciweavers

417 search results - page 22 / 84
» Orderings for Innermost Termination
Sort
View
ICIP
2009
IEEE
14 years 8 months ago
Early Terminating Algorithms For Adaboost Based Detectors
In this paper we propose an early termination algorithm for speeding up the detection phase of the Adaboost based detectors. In the basic algorithm, at a specific search location,...
LOPSTR
1994
Springer
13 years 11 months ago
A Transformation System for Definite Programs Based on Termination Analysis
We present a goal replacement rule whose main applicability condition is based on termination properties of the resulting transformed program. The goal replacement rule together wi...
J. Cook, John P. Gallagher
JRTIP
2008
118views more  JRTIP 2008»
13 years 7 months ago
A fast feature-assisted adaptive early termination approach for multiple reference frames motion estimation in H.264
Abstract The multiple reference frames motion estimation approach used in H.264 is computationally intensive. This paper presents a fast or computationally efficient feature-assist...
Jianfeng Ren, Nasser D. Kehtarnavaz, Madhukar Buda...
GLOBECOM
2009
IEEE
13 years 5 months ago
Implementation and Benchmarking of Hardware Accelerators for Ciphering in LTE Terminals
Abstract--In this paper we investigate hardware implementations of ciphering algorithms, SNOW 3G and the Advanced Encryption Standard (AES), for the acceleration of the protocol st...
Sebastian Hessel, David Szczesny, Nils Lohmann, At...
CALCO
2009
Springer
162views Mathematics» more  CALCO 2009»
14 years 2 months ago
Semantics of Higher-Order Recursion Schemes
Higher-order recursion schemes are equations defining recursively new operations from given ones called “terminals”. Every such recursion scheme is proved to have a least inte...
Jirí Adámek, Stefan Milius, Jiri Vel...