Sciweavers

AAECC
2006
Springer
133views Algorithms» more  AAECC 2006»
13 years 11 months ago
On the low hamming weight discrete logarithm problem for nonadjacent representations
So-called nonadjacent representations are commonly used in elliptic curve cryptography to facilitate computing a scalar multiple of a point on an elliptic curve. A nonadjacent rep...
James A. Muir, Douglas R. Stinson
AAECC
2006
Springer
100views Algorithms» more  AAECC 2006»
13 years 11 months ago
On Doubly-Cyclic Convolutional Codes
Cyclicity of a convolutional code (CC) is relying on a nontrivial automorphism of the algebra F[x]/(xn - 1), where F is a finite field. A particular choice of the data leads to th...
Heide Gluesing-Luerssen, Wiland Schmale
AAECC
2006
Springer
77views Algorithms» more  AAECC 2006»
13 years 11 months ago
Protecting against key-exposure: strongly key-insulated encryption with optimal threshold
A new framework for protection against key exposure was recently suggested by Dodis et. al. [16]. We take its realization further towards practice by presenting simple new schemes...
Mihir Bellare, Adriana Palacio
AAECC
2006
Springer
133views Algorithms» more  AAECC 2006»
13 years 11 months ago
The Berlekamp-Massey Algorithm revisited
We propose a slight modification of the Berlekamp-Massey Algorithm for obtaining the minimal polynomial of a given linearly recurrent sequence. Such a modification enables to expl...
Nadia Ben Atti, Gema M. Diaz-Toca, Henri Lombardi
AAECC
2006
Springer
135views Algorithms» more  AAECC 2006»
13 years 11 months ago
Computing Hypergeometric Solutions of Linear Recurrence Equations
We describe a complete algorithm to compute the hypergeometric solutions of linear recurrence relations with rational function coefficients. We use the notion of finite singularit...
Thomas Cluzeau, Mark van Hoeij
AAECC
2006
Springer
90views Algorithms» more  AAECC 2006»
13 years 11 months ago
Apparent singularities of linear difference equations with polynomial coefficients
Sergei A. Abramov, Moulay A. Barkatou, Mark van Ho...
EOR
2010
133views more  EOR 2010»
13 years 11 months ago
A memetic algorithm for graph coloring
Given an undirected graph G = (V, E) with a set V of vertices and a set E of edges, the graph coloring problem consists of partitioning all vertices into k independent sets and th...
Zhipeng Lü, Jin-Kao Hao
DKE
2008
113views more  DKE 2008»
13 years 11 months ago
An efficient algorithm for mining closed inter-transaction itemsets
In this paper, we propose an efficient algorithm, called ICMiner (Inter-transaction Closed patterns Miner), for mining closed inter-transaction itemsets. Our proposed algorithm co...
Anthony J. T. Lee, Chun-sheng Wang, Wan-Yu Weng, Y...
ENDM
2010
130views more  ENDM 2010»
13 years 11 months ago
Experimental Analysis of an Online Trading Algorithm
Trading decisions in financial markets can be supported by the use of online algorithms. We evaluate the empirical performance of a threat-based online algorithm and compare it to...
Günter Schmidt, Esther Mohr, Mike Kersch
DKE
2008
109views more  DKE 2008»
13 years 11 months ago
Deterministic algorithms for sampling count data
Processing and extracting meaningful knowledge from count data is an important problem in data mining. The volume of data is increasing dramatically as the data is generated by da...
Hüseyin Akcan, Alex Astashyn, Hervé Br...