This paper presents an algebro-geometric solution to the problem of segmenting an unknown number of subspaces of unknown and varying dimensions from sample data points. We represen...
The problem of compact tables is to maximise the overlap when building a word that is to include permutations of every given words (all the words being the same length). This probl...
Testing whether there is an induced path in a graph spanning k given vertices is already NP-complete in general graphs when k = 3. We show how to solve this problem in polynomial t...
Gaudry and Schost gave a low-memory algorithm for solving the 2-dimensional discrete logarithm problem. We present an improvement to their algorithm and extend this improvement to ...
This paper aims to identify the missing links from theory of Genetic Algorithms (GAs) to application of GAs. Categories and Subject Descriptors: J.0 [Computer Applications]: Gener...