8647 search results - page 501 / 1730 » The Container Selection Problem |
164
click to vote
SIAMCOMP
2010
15 years 1 months ago
2010
The (undirected) Steiner Network problem is: given a graph = ( , ) with edge/node-weights and edge-connectivity requirements { ( , ) : , }, find a minimumweight subgraph of conta...
188
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
The theory revision problem is the problem of how best to go about revising a deficient domain theory using information contained in examples that expose inaccuracies. In this pa...
133
click to vote
ICIP
2004
IEEE
16 years 8 months ago
2004
IEEE
The decomposition of an image into its primitive components, such as cartoon plus texture, is a fundamental problem in image processing. In [11, 16], the authors proposed a techni...
185
click to vote
ICIP
1997
IEEE
16 years 7 months ago
1997
IEEE
In this paper we introduce a novel optimization framework for hierarchical data clustering and apply it to the problem of unsupervised texture segmentation. The proposed objective...
176
click to vote
CEC
2008
IEEE
16 years 24 days ago
2008
IEEE
— We present the memetic climber, a simple search algorithm that learns topology and weights of neural networks on different time scales. When applied to the problem of learning ...