4266 search results - page 159 / 854 » The container loading problem |
132
click to vote
CAIP
2005
Springer
15 years 9 months ago
2005
Springer
We consider simple cube-curves in the orthogonal 3D grid. The union of all cells contained in such a curve (also called the tube of this curve) is a polyhedrally bounded set. The c...
124
click to vote
PKDD
2005
Springer
15 years 9 months ago
2005
Springer
Sequential pattern mining has been an emerging problem in data mining. In this paper, we propose a new algorithm for mining frequent sequences. It processes only one scan of the da...
103
click to vote
DCC
1998
IEEE
15 years 8 months ago
1998
IEEE
Books and magazines often contain pages containing audacious mixtures of color images and text. Our problem consists in coding the background colors of a such documents without wa...
126
Voted
COMPGEOM
2006
ACM
15 years 7 months ago
2006
ACM
We prove that any collection of n discs in which each one intersects at most k others, can be colored with at most O(log3 k) colors so that for each point p in the union of all di...
120
click to vote
EMNLP
2007
15 years 5 months ago
2007
The increasing use of large open-domain document sources is exacerbating the problem of ambiguity in named entities. This paper explores the use of a range of syntactic and semant...