Sciweavers

4378 search results - page 168 / 876
» On the Complexity of Ordered Colourings
Sort
View
PPL
2010
118views more  PPL 2010»
15 years 4 months ago
Coping with Decoherence: Parallelizing the Quantum Fourier Transform
Rank-varying computational complexity describes those computations in which the complexity of executing each step is not a constant, but evolves throughout the computation as a fu...
Marius Nagy, Selim G. Akl
ICASSP
2011
IEEE
14 years 10 months ago
Fast algorithms for Iterative Adaptive Approach spectral estimation techniques
This paper presents computationally efficient implementations for Iterative Adaptive Approach (IAA) spectral estimation techniques for uniformly sampled data sets. By exploiting ...
George-Othon Glentis, Andreas Jakobsson
ESA
2011
Springer
269views Algorithms» more  ESA 2011»
14 years 6 months ago
Alphabet-Independent Compressed Text Indexing
Self-indexes can represent a text in asymptotically optimal space under the k-th order entropy model, give access to text substrings, and support indexed pattern searches. Their ti...
Djamal Belazzougui, Gonzalo Navarro
ISCAS
2002
IEEE
89views Hardware» more  ISCAS 2002»
15 years 11 months ago
Mapping the wavelet transform onto silicon: the dynamic translinear approach
In this paper, an analog implementation of the Wavelet Transform (WT) is presented. The circuit is based on the Dynamic Translinear (DTL) circuit technique and implements, by mean...
Sandro A. P. Haddad, Wouter A. Serdijn
APVIS
2007
15 years 8 months ago
Visualisation and analysis of the internet movie database
In this paper, we present a case study for the visualisation and analysis of large and complex temporal multivariate networks derived from the Internet Movie DataBase (IMDB). Our ...
Adel Ahmed, Vladimir Batagelj, Xiaoyan Fu, Seok-He...