Sciweavers

481 search results - page 40 / 97
» A Fast Program Generator of Fast Fourier Transforms
Sort
View
BIRTHDAY
1994
Springer
15 years 1 months ago
Generalizing Cook's Transformation to Imperative Stack Programs
Cook's construction from 1971 [4] shows that any two-way deterministic pushdown automaton (2DPDA) can be simulated in time O(n), where n is the length of its input string, and...
Nils Andersen, Neil D. Jones
SEFM
2008
IEEE
15 years 4 months ago
A Fast Algorithm to Compute Heap Memory Bounds of Java Card Applets
We present an approach to find upper bounds of heap space for Java Card applets. Our method first transforms an input bytecode stream into a control flow graph (CFG), and then ...
Tuan-Hung Pham, Anh-Hoang Truong, Ninh-Thuan Truon...
SAS
1997
Springer
111views Formal Methods» more  SAS 1997»
15 years 1 months ago
Fast and Effective Procedure Inlining
is an important optimization for programs that use procedural abstraction. Because inlining trades code size for execution speed, the effectiveness of an inlining algorithm is det...
Oscar Waddell, R. Kent Dybvig
ISBI
2006
IEEE
15 years 10 months ago
A fast and robust ODF estimation algorithm in Q-ball imaging
We propose a simple and straightforward analytic solution for the Q-ball reconstruction of the diffusion orientation distribution function (ODF) of the underlying fiber population...
Maxime Descoteaux, Elaine Angelino, Shaun Fitzgibb...
IJCV
2010
186views more  IJCV 2010»
14 years 8 months ago
An Approach to the Parameterization of Structure for Fast Categorization
A decomposition is described, which parameterizes the geometry and appearance of contours and regions of gray-scale images with the goal of fast categorization. To express the con...
Christoph Rasche