7 search results - page 2 / 2 » Large linear classification when data cannot fit in memory |
ALGORITHMICA
2000
13 years 4 months ago
2000
We study the problem of minimizing the expected cost of binary searching for data where the access cost is not fixed and depends on the last accessed element, such as data stored i...
CORR
2000
Springer
13 years 4 months ago
2000
Springer
When comparing inductive logic programming (ILP) and attribute-value learning techniques, there is a trade-off between expressive power and efficiency. Inductive logic programming ...