Sciweavers

2626 search results - page 366 / 526
» The complexity of stochastic sequences
Sort
View
AAECC
2007
Springer
109views Algorithms» more  AAECC 2007»
16 years 23 days ago
The Tangent FFT
The split-radix FFT computes a size-n complex DFT, when n is a large power of 2, using just 4n lg n−6n+8 arithmetic operations on real numbers. This operation count was first an...
Daniel J. Bernstein
BTW
2007
Springer
166views Database» more  BTW 2007»
16 years 22 days ago
Hierarchy-driven Visual Exploration of Multidimensional Data Cubes
: Analysts interact with OLAP data in a predominantly “drill-down” fashion, i.e. gradually descending from a coarsely grained overview towards the desired level of detail. Anal...
Svetlana Mansmann, Florian Mansmann, Marc H. Schol...
FCCM
2005
IEEE
107views VLSI» more  FCCM 2005»
16 years 5 days ago
Simplifying the Integration of Processing Elements in Computing Systems Using a Programmable Controller
As technology sizes decrease and die area increases, designers are creating increasingly complex computing systems using FPGAs. To reduce design time for new products, the reuse o...
Lesley Shannon, Paul Chow
ICALT
2005
IEEE
16 years 5 days ago
Learning Units Design Based in Grid Computing
: The development of cooperative, flexible and reusable learning environments is a need in modern education. The IMS Learning Design specification has played a very important role ...
Leonel Iriarte Navarro, Manuel Marco Such, Alexand...
ICCS
2005
Springer
16 years 2 days ago
Dynamic Data Driven Coupling of Continuous and Discrete Methods for 3D Tracking
We present a new framework for robust 3D tracking, using a dynamic data driven coupling of continuous and discrete methods to overcome their limitations. Our method uses primarily ...
Dimitris N. Metaxas, Gabriel Tsechpenakis