Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Search
 
Pethv, Attila
University of Debrecen
Debrecen, Hungary
 
   Reviewer Selected
Follow this Reviewer
 
 
 
Options:
Date Reviewed  
 
1
- 10 of 43 reviews

   
  A new general expression for 2-channel FIR paraunitary filterbanks
Domínguez Jiménez M. Signal Processing 88(7): 1725-1732, 2008.  Type: Article

Orthogonal filters have applications in many areas of signal processing. In this paper, the author presents a simple and explicit expression for real orthogonal filters....

Sep 29 2008  
  Advances in symmetric sandpiles
Formenti E., Masson B., Pisokas T. Fundamenta Informaticae 76(1-2): 91-112, 2007.  Type: Article

A formal sandpile is a finite sequence of integers (c1, ... , cr) that is obtained by applying the following rules: the initial value is (n
May 14 2008  
  The Berlekamp-Massey algorithm revisited
Atti N., Diaz–Toca G., Lombardi H. Applicable Algebra in Engineering, Communication and Computing 17(1): 75-82, 2006.  Type: Article

The authors of this paper “propose a slight modification of the Berlekamp-Massey algorithm for obtaining the minimal polynomial of a given linearly recurrent sequence.”...

Jan 22 2008  
  Reversals and palindromes in continued fractions
Adamczewski B., Allouche J. Theoretical Computer Science 380(3): 220-237, 2007.  Type: Article

Let the continued fraction expansion of the real number &agr; be [a0, a1, ... ]. Denote pn/q
Jan 17 2008  
  A new mixed radix conversion algorithm MRC-II
Akkal M., Siy P. Journal of Systems Architecture: the EUROMICRO Journal 53(9): 577-586, 2007.  Type: Article

Let m1, ... , mn be pairwise coprime integers. By the Chinese remainder theorem to each integer 0 ≤ x < M, where M...

Nov 1 2007  
  On the security of stepwise triangular systems
Wolf C., Braeken A., Preneel B. Designs, Codes and Cryptography 40(3): 285-302, 2006.  Type: Article

Let F be a finite field of q elements and P′ be a system of quadratic polynomials p1, ... , pm<...

Apr 11 2007  
  Bilinear algorithms for discrete cosine transforms of prime lengths
Muddhasani V., Wagh M. Signal Processing 86(9): 2393-2406, 2006.  Type: Article

The discrete cosine transform (DCT) of the p term sequence x(i) is defined by...

Jan 15 2007  
  Efficient parallel factorization and solution of structured and unstructured linear systems
Reif J. Journal of Computer and System Sciences 71(1): 86-143, 2005.  Type: Article

This is a very interesting paper on the parallel complexity of basic problems of matrices with rational entries. The PRAM model is used, meaning the processor is capable of doing arithmetical and logical operations (addition, subtracti...

Jun 23 2006  
  Proof of a conjecture on unimodality
Wang Y., Yeh Y. European Journal of Combinatorics 26(5): 617-627, 2005.  Type: Article

Let a0, ... ,am be a sequence of nonnegative real numbers. The sequence is unimodal if there exists an index 0 < t
Oct 28 2005  
  Parallel Decoding Cyclic Burst Error Correcting Codes
Umanesan G., Fujiwara E. IEEE Transactions on Computers 54(1): 87-92, 2005.  Type: Article

Let C be a binary (N,K) cyclic or shortened cyclic code with l-bit burst error correcting capacity. Assume that C is defined by a generator polynomial
Jul 28 2005  
 
 
 
Display per column
 
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy