4378 search results - page 97 / 876 » On the Complexity of Ordered Colourings |
DBA
2004
13 years 10 months ago
2004
In order to guarantee efficient query processing together with industrial strength, spatial index structures have to be integrated into fully-fledged object-relational database ma...
ALGORITHMICA
2008
13 years 9 months ago
2008
The profile of a graph is an integer-valued parameter defined via vertex orderings; it is known that the profile of a graph equals the smallest number of edges of an interval supe...
ICALP
2003
Springer
14 years 2 months ago
2003
Springer
Resource-bounded dimension is a complexity-theoretic extension of classical Hausdorff dimension introduced by Lutz (2000) in order to investigate the fractal structure of sets th...
DEXAW
1999
IEEE
14 years 1 months ago
1999
IEEE
A robust method for the localization of frames within document images is presented. It aims at detecting regions delimited by closed polygonal lines or edges in complex color, gra...
KDD
1997
ACM
14 years 1 months ago
1997
ACM
Sequential Data This paper is about the unsuperviseddiscovery of patterns in sequencesof compositeobjects. A compositeobject may be describedas a sequenceof other, simpler data. In...