Sciweavers

2150 search results - page 112 / 430
» On a restricted cross-intersection problem
Sort
View
ESA
2009
Springer
98views Algorithms» more  ESA 2009»
15 years 11 months ago
Reconstructing 3-Colored Grids from Horizontal and Vertical Projections Is NP-hard
We consider the problem of coloring a grid using k colors with the restriction that in each row and each column has an specific number of cells of each color. In an already classi...
Christoph Dürr, Flavio Guiñez, Mart&ia...
144
Voted
IJCNN
2008
IEEE
15 years 11 months ago
Support vector machines and dynamic time warping for time series
— Effective use of support vector machines (SVMs) in classification necessitates the appropriate choice of a kernel. Designing problem specific kernels involves the definition...
Steinn Gudmundsson, Thomas Philip Runarsson, Sven ...
135
Voted
GECCO
2007
Springer
191views Optimization» more  GECCO 2007»
15 years 11 months ago
An artificial immune system with partially specified antibodies
Artificial Immune System algorithms use antibodies which fully specify the solution of an optimization, learning, or pattern recognition problem. By being restricted to fully spec...
Ramin Halavati, Saeed Bagheri Shouraki, Mojdeh Jal...
LICS
2005
IEEE
15 years 10 months ago
Model-Checking Hierarchical Structures
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
Markus Lohrey
ECML
2005
Springer
15 years 10 months ago
Fitting the Smallest Enclosing Bregman Ball
Finding a point which minimizes the maximal distortion with respect to a dataset is an important estimation problem that has recently received growing attentions in machine learnin...
Richard Nock, Frank Nielsen