4378 search results - page 97 / 876 » On the Complexity of Ordered Colourings |
188
click to vote
DBA
2004
15 years 7 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...
197
click to vote
ALGORITHMICA
2008
15 years 6 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...
148
click to vote
ICALP
2003
Springer
15 years 11 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...
157
click to vote
DEXAW
1999
IEEE
15 years 10 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...
123
click to vote
KDD
1997
ACM
15 years 10 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...