Sciweavers

4581 search results - page 205 / 917
» Computing Transformation Semigroups
Sort
View
SEFM
2008
IEEE
16 years 28 days 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...
VL
2006
IEEE
16 years 17 days ago
Sketching with Conceptual Metaphors to Explain Computational Processes
To explore how people conceptualize a complex system, 232 university students were asked to sketch how a search engine works. While the sketches reveal a diverse range of visual a...
David G. Hendry
ISMIS
2005
Springer
16 years 1 days ago
Getting Computers to See Information Graphics So Users Do Not Have to
Abstract. Information graphics such as bar, line and pie charts appear frequently in electronic media and often contain information that is not found elsewhere in documents. Unfort...
Daniel Chester, Stephanie Elzer
LPAR
2005
Springer
16 years 1 days ago
Termination of Fair Computations in Term Rewriting
Abstract. The main goal of this paper is to apply rewriting termination technology —enjoying a quite mature set of termination results and tools— to the problem of proving auto...
Salvador Lucas, José Meseguer
SBCCI
2003
ACM
135views VLSI» more  SBCCI 2003»
15 years 11 months ago
Modeling a Reconfigurable System for Computing the FFT in Place via Rewriting-Logic
The growing adoption of reconfigurable architectures opens new implementation alternatives and creates new design challenges. In the case of dynamically reconfigurable architectur...
Mauricio Ayala-Rincón, Rodrigo B. Nogueira,...