Sciweavers

IMA
2009
Springer
111views Cryptology» more  IMA 2009»
14 years 6 months ago
Geometric Ideas for Cryptographic Equation Solving in Even Characteristic
Abstract. The GeometricXL algorithm is a geometrically invariant version of the XL algorithm that uses polynomials of a much smaller degree than either a standard Groebner basis al...
Sean Murphy, Maura B. Paterson
IDA
2009
Springer
14 years 6 months ago
Image Coding and Compression with Sparse 3D Discrete Cosine Transform
In this paper, an algorithm for image coding based on a sparse 3-dimensional Discrete Cosine Transform (3D DCT) is studied. The algorithm is essentially a method for achieving a su...
Hamid Palangi, Aboozar Ghafari, Massoud Babaie-Zad...
ICNC
2009
Springer
14 years 6 months ago
An Improved Greedy Genetic Algorithm for Solving Travelling Salesman Problem
—Genetic algorithm (GA) is too dependent on the initial population and a lack of local search ability. In this paper, an improved greedy genetic algorithm (IGAA) is proposed to o...
Zhenchao Wang, Haibin Duan, Xiangyin Zhang
ICHIT
2009
Springer
14 years 6 months ago
An efficient algorithm for AS path inferring
Discovering the AS paths between two ASes are invaluable for a wide area of network research and application activities. The traditional techniques for path discovery require dire...
Guoqiang Yang, Wenhua Dou
ICCS
2009
Springer
14 years 6 months ago
Experience with Approximations in the Trust-Region Parallel Direct Search Algorithm
Recent years have seen growth in the number of algorithms designed to solve challenging simulation-based nonlinear optimization problems. One such algorithm is the Trust-Region Par...
S. M. Shontz, V. E. Howle, P. D. Hough
GECCO
2009
Springer
128views Optimization» more  GECCO 2009»
14 years 6 months ago
Neural network ensembles for time series forecasting
This work provides an analysis of using the evolutionary algorithm EPNet to create ensembles of artificial neural networks to solve a range of forecasting tasks. Several previous...
Victor M. Landassuri-Moreno, John A. Bullinaria
GBRPR
2009
Springer
14 years 6 months ago
Graph Matching Based on Node Signatures
We present an algorithm for graph matching in a pattern recognition context. This algorithm deals with weighted graphs, based on new structural and topological node signatures. Usi...
Salim Jouili, Salvatore Tabbone
FM
2009
Springer
106views Formal Methods» more  FM 2009»
14 years 6 months ago
Translating Safe Petri Nets to Statecharts in a Structure-Preserving Way
Statecharts and Petri nets are two popular visual formalisms for modelling complex systems that exhibit concurrency. Both formalisms are supported by various design tools. To enabl...
Rik Eshuis
ESA
2009
Springer
143views Algorithms» more  ESA 2009»
14 years 6 months ago
On Optimally Partitioning a Text to Improve Its Compression
In this paper we investigate the problem of partitioning an input string T in such a way that compressing individually its parts via a basecompressor C gets a compressed output th...
Paolo Ferragina, Igor Nitto, Rossano Venturini
ESA
2009
Springer
127views Algorithms» more  ESA 2009»
14 years 6 months ago
Maximum Flow in Directed Planar Graphs with Vertex Capacities
In this paper we present an O(n log n) algorithm for finding a maximum flow in a directed planar graph, where the vertices are subject to capacity constraints, in addition to the...
Haim Kaplan, Yahav Nussbaum