Sciweavers

14158 search results - page 156 / 2832
» Generalized switch-setting problems
Sort
View
CVPR
2003
IEEE
16 years 5 months ago
Generalized Principal Component Analysis (GPCA)
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...
René Vidal, Shankar Sastry, Yi Ma
140
Voted
JAC
2008
15 years 4 months ago
Study of the NP-completeness of the compact table problem
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...
Jean-Christophe Dubacq, Jean-Yves Moyen
125
Voted
STACS
2010
Springer
15 years 10 months ago
The k-in-a-path Problem for Claw-free Graphs
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...
Jirí Fiala, Marcin Kaminski, Bernard Lidick...
IMA
2009
Springer
131views Cryptology» more  IMA 2009»
15 years 10 months ago
An Improvement to the Gaudry-Schost Algorithm for Multidimensional Discrete Logarithm Problems
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 ...
Steven D. Galbraith, Raminder S. Ruprai
GECCO
2008
Springer
118views Optimization» more  GECCO 2008»
15 years 4 months ago
Deriving evaluation metrics for applicability of genetic algorithms to optimization problems
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...
Hsinyi Jiang, Carl K. Chang