240 search results - page 29 / 48 » On Efficient Construction of Decision Trees from Large Datab... |
KDD
2008
ACM
14 years 8 months ago
2008
ACM
IT problem management calls for quick identification of resolvers to reported problems. The efficiency of this process highly depends on ticket routing--transferring problem ticke...
TCC
2009
Springer
14 years 8 months ago
2009
Springer
We consider the problem of memory checking, where a user wants to maintain a large database on a remote server but has only limited local storage. The user wants to use the small ...
VLDB
1998
ACM
13 years 11 months ago
1998
ACM
Text data in the Internet can be partitioned into many databases naturally. Efficient retrieval of desired data can be achieved if we can accurately predict the usefulness of each...
ICDE
2009
IEEE
14 years 9 months ago
2009
IEEE
Given a set of points P and a query point q, the reverse furthest neighbor (RFN) query fetches the set of points p P such that q is their furthest neighbor among all points in P {...
ESANN
2004
13 years 9 months ago
2004
This work focuses on one of the most critical issues to plague the wireless telecommunications industry today: the loss of a valuable subscriber to a competitor, also defined as ch...