3019 search results - page 388 / 604 » Approximating the Domatic Number |
169
click to vote
PKDD
1999
Springer
15 years 11 months ago
1999
Springer
We describe the problem of mining possibilistic set-valued rules in large relational tables containing categorical attributes taking a finite number of values. An example of such a...
168
click to vote
STACS
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...
202
click to vote
TACAS
1998
Springer
15 years 10 months ago
1998
Springer
This paper enables symbolic ternary simulation of systems with large embedded memories. Each memory array is replaced with a behavioral model, where the number of symbolic variable...
187
click to vote
STOC
1997
ACM
15 years 10 months ago
1997
ACM
We consider the paging problem where the pages have varying size. This problem has applications to page replacement policies for caches containing World Wide Web documents. We con...
205
click to vote
ECML
1997
Springer
15 years 10 months ago
1997
Springer
Abstract. E cient data mining algorithms are crucial fore ective knowledge discovery. We present the Multi-Stream Dependency Detection (msdd) data mining algorithm that performs a ...