Sciweavers

TSP
2008
114views more  TSP 2008»
13 years 11 months ago
Universal Switching Linear Least Squares Prediction
We consider sequential regression of individual sequences under the square error loss. Using a competitive algorithm framework, we construct a sequential algorithm that can achieve...
Suleyman Serdar Kozat, Andrew C. Singer
TSP
2008
89views more  TSP 2008»
13 years 11 months ago
The Kernel Least-Mean-Square Algorithm
The combination of the famed kernel trick and the least-mean-square (LMS) algorithm provides an interesting sample by sample update for an adaptive filter in reproducing Kernel Hil...
Weifeng Liu, Puskal P. Pokharel, Jose C. Principe
TSP
2008
180views more  TSP 2008»
13 years 11 months ago
Support Vector Machine Training for Improved Hidden Markov Modeling
We present a discriminative training algorithm, that uses support vector machines (SVMs), to improve the classification of discrete and continuous output probability hidden Markov ...
Alba Sloin, David Burshtein
AAECC
2004
Springer
76views Algorithms» more  AAECC 2004»
13 years 11 months ago
On the Security of RSA with Primes Sharing Least-Significant Bits
Abstract. We investigate the security of a variant of the RSA public-key cryptosystem called LSBS-RSA, in which the modulus primes share a large number of least-significant bits.We...
Ron Steinfeld, Yuliang Zheng
AAECC
2004
Springer
100views Algorithms» more  AAECC 2004»
13 years 11 months ago
Convolutional Codes of Goppa Type
A new kind of Convolutional Codes generalizing Goppa Codes is proposed. This provides a systematic method for constructing convolutional codes with prefixed properties. In particul...
J. A. Domínguez Pérez, J. M. Mu&ntil...
AAECC
2004
Springer
83views Algorithms» more  AAECC 2004»
13 years 11 months ago
Bounding the Trellis State Complexity of Algebraic Geometric Codes
Abstract. Let C be an algebraic geometric code of dimension k and length n constructed on a curve X over Fq. Let s(C) be the state complexity of C and set w(C) := min{k, n-k}, the ...
Carlos Munuera, Fernando Torres
AAECC
2004
Springer
87views Algorithms» more  AAECC 2004»
13 years 11 months ago
DFT-based Word Normalization in Finite Supersolvable Groups
Abstract. In this paper we discuss the word normalization problem in pc presented finite supersolvable groups: given two group elements a and b in normal form the normal form of th...
Meinard Müller, Michael Clausen
AAECC
2004
Springer
120views Algorithms» more  AAECC 2004»
13 years 11 months ago
The Middle Product Algorithm I
We present new algorithms for the inverse, division, and square root of power series. The key trick is a new algorithm
Guillaume Hanrot, Michel Quercia, Paul Zimmermann
AAECC
2004
Springer
63views Algorithms» more  AAECC 2004»
13 years 11 months ago
Computation of the Decomposition Group of a Triangular Ideal
Abstract. This article describes two algorithms in order to search decomposition groups of ideals of polynomials with coefficients in a perfect field when those ideals are generate...
I. Abdeljaouad-Tej, Sébastien Orange, Gu&ea...
JNW
2007
75views more  JNW 2007»
13 years 11 months ago
Improving and Analyzing LC-Trie Performance for IP-Address Lookup
— IP-address lookup is a key processing function of Internet routers. The lookup is challenging because it needs to perform a longest prefix match. In this paper, we present our...
Jing Fu, Olof Hagsand, Gunnar Karlsson