4266 search results - page 231 / 854 » The container loading problem |
120
click to vote
ESA
2010
Springer
15 years 5 months ago
2010
Springer
Minor containment is a fundamental problem in Algorithmic Graph Theory, as numerous graph algorithms use it as a subroutine. A model of a graph H in a graph G is a set of disjoint ...
148
click to vote
IJMSO
2008
15 years 4 months ago
2008
: Automatically recognising which HTML documents on the Web contain items of interest for a user is non-trivial. As a step toward solving this problem, we propose an approach based...
153
click to vote
NETWORKS
2008
15 years 4 months ago
2008
In a problem arising in grooming for two-period optical networks, it is required to decompose the complete graph on n vertices into subgraphs each containing at most C edges, so t...
143
click to vote
ACS
2000
15 years 4 months ago
2000
Abstract. We develop a general setting for the treatment of extensions of categories by means of freely adjoined morphisms. To this end, we study what we call composition graphs, i...
131
click to vote
PRL
2007
15 years 3 months ago
2007
One of the most widely used approaches in the context of object recognition across illumination changes consists in comparing the images by means of the intersection between invar...