706 search results - page 109 / 142 » Efficient Algorithms for k -Disjoint Paths Problems on DAGs |
AAAI
2010
13 years 10 months ago
2010
Multi-instance learning deals with problems that treat bags of instances as training examples. In single-instance learning problems, dimensionality reduction is an essential step ...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
Given data drawn from a mixture of multivariate Gaussians, a basic problem is to accurately estimate the mixture parameters. We give an algorithm for this problem that has running ...
CIE
2007
Springer
14 years 3 months ago
2007
Springer
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
ET
2002
13 years 8 months ago
2002
Due to technology scaling and increasing clock frequency, problems due to noise effects lead to an increase in design/debugging efforts and a decrease in circuit performance. This...
GECCO
2010
Springer
14 years 1 months ago
2010
Springer
This study proposes a simple computational model of evolutionary learning in organizations informed by genetic algorithms. Agents who interact only with neighboring partners seek ...