81 search results - page 4 / 17 » Parameterized algorithmics for linear arrangement problems |
SGP
2003
13 years 8 months ago
2003
We solve the problem of computing global conformal parameterizations for surfaces with nontrivial topologies. The parameterization is global in the sense that it preserves the con...
LATA
2009
Springer
14 years 2 months ago
2009
Springer
The parameterized pattern matching problem is a kind of pattern matching problem, where a pattern is considered to occur in a text when there exists a renaming bijection on the alp...
SODA
2010
ACM
14 years 4 months ago
2010
ACM
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
AE
2005
Springer
14 years 1 months ago
2005
Springer
This paper presents a new Memetic Algorithm designed to compute near optimal solutions for the MinLA problem. It incorporates a highly specialized crossover operator, a fast MinLA ...
NIPS
1997
13 years 8 months ago
1997
We study on-line generalized linear regression with multidimensional outputs, i.e., neural networks with multiple output nodes but no hidden nodes. We allow at the final layer tra...