4378 search results - page 373 / 876 » On the Complexity of Ordered Colourings |
210
click to vote
PKDD
1999
Springer
15 years 11 months ago
1999
Springer
When mining a large database, the number of patterns discovered can easily exceed the capabilities of a human user to identify interesting results. To address this problem, variou...
194
click to vote
SPAA
1998
ACM
15 years 11 months ago
1998
ACM
Modern shared-memory multiprocessors use complex memory system implementations that include a variety of non-trivial and interacting optimizations. More time is spent in verifying...
188
Voted
WG
1998
Springer
15 years 11 months ago
1998
Springer
In this work we introduce the class of graphs with bounded induced distance of order k, (BID(k) for short). A graph G belongs to BID(k) if the distance between any two nodes in ev...
162
click to vote
NIPS
2001
15 years 8 months ago
2001
Mutual information is widely used, in a descriptive way, to measure the stochastic dependence of categorical random variables. In order to address questions such as the reliabilit...
197
click to vote
JSYML
2007
15 years 6 months ago
2007
We investigate the complexity of various combinatorial theorems about linear and partial orders, from the points of view of computability theory and reverse mathematics. We focus ...