Sciweavers

632 search results - page 22 / 127
» Specifying Algorithm Visualizations in Terms of Data Flow
Sort
View
DATE
2008
IEEE
163views Hardware» more  DATE 2008»
14 years 3 months ago
Design flow for embedded FPGAs based on a flexible architecture template
Modern digital signal processing applications have an increasing demand for computational power while needing to preserve low power dissipation and high flexibility. For many appl...
B. Neumann, Thorsten von Sydow, Holger Blume, Tobi...
ICMCS
2006
IEEE
103views Multimedia» more  ICMCS 2006»
14 years 3 months ago
Multiplierless Approximation of Fast DCT Algorithms
This paper proposes an effective method for converting any fast DCT algorithm into an approximate multiplierless version. Basically it approximates any constant in the original tr...
Raymond Chan, Moon-chuen Lee
GIS
2002
ACM
13 years 8 months ago
Interactive 3D visualization of vector data in GIS
Vector data represents one major category of data managed by GIS. This paper presents a new technique for vector-data display that is able to precisely and efficiently map vector ...
Oliver Kersting, Jürgen Döllner
SIGCSE
2004
ACM
101views Education» more  SIGCSE 2004»
14 years 2 months ago
Effective features of algorithm visualizations
Many algorithm visualizations have been created, but little is known about which features are most important to their success. We believe that pedagogically useful visualizations ...
Purvi Saraiya, Clifford A. Shaffer, D. Scott McCri...
IPPS
2005
IEEE
14 years 2 months ago
Dynamic Reconfiguration of Mechatronic Real-Time Systems Based on Configuration State Machines
Data flow and FSMs are used intensively to specify real-time systems in the field of mechatronics. Their implementation in FPGAs is discussed against the background of dynamic rec...
Steffen Toscher, Roland Kasper, Thomas Reinemann