Sciweavers

406 search results - page 29 / 82
» Fast Increment Registers
Sort
View
VISUALIZATION
1995
IEEE
14 years 1 months ago
Sweeping Simplices: A Fast Iso-Surface Extraction Algorithm for Unstructured Grids
We present an algorithm that accelerates the extraction of iso-surfaces from unstructured grids by avoiding the traversal of the entire set of cells in the volume. The algorithm c...
Han-Wei Shen, Christopher R. Johnson
MICCAI
2008
Springer
14 years 11 months ago
Spherical Demons: Fast Surface Registration
Abstract. We present the fast Spherical Demons algorithm for registering two spherical images. By exploiting spherical vector spline interpolation theory, we show that a large clas...
B. T. Thomas Yeo, Mert R. Sabuncu, Tom Vercauter...
SIPS
2007
IEEE
14 years 4 months ago
Embedded Reconfigurable Solution for OFDM Detection Over Fast Fading Radio Channels
OFDM demodulation under fast fading radio channels is very computationally demanding, making the implementation of Software Defined Radio (SDR) solutions problematic. A suboptima...
Mihai Sima, Michael McGuire
FPL
2005
Springer
140views Hardware» more  FPL 2005»
14 years 3 months ago
A Configuration Memory Architecture for Fast Run-Time-Reconfiguration of FPGAs
This paper presents a configuration memory architecture that offers fast FPGA reconfiguration. The underlying principle behind the design is the use of fine-grained partial rec...
Usama Malik, Oliver Diessel
IWMM
2000
Springer
144views Hardware» more  IWMM 2000»
14 years 1 months ago
Memory Allocation with Lazy Fits
Dynamic memory allocation is an important part of modern programming languages. It is important that it be done fast without wasting too much memory. Memory allocation using lazy ...
Yoo C. Chung, Soo-Mook Moon