1403 search results - page 5 / 281 » Set cover algorithms for very large datasets |
NIPS
2001
13 years 9 months ago
2001
Support Vector Machines (SVMs) are currently the state-of-the-art models for many classication problems but they suer from the complexity of their training algorithm which is at l...
IVS
2002
13 years 8 months ago
2002
Simple presentation graphics are intuitive and easy-to-use, but show only highly aggregated data presenting only a very small number of data values (as in the case of bar charts) ...
TASE
2010
IEEE
13 years 3 months ago
2010
IEEE
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
AUSAI
2003
Springer
14 years 1 months ago
2003
Springer
Efficient mining of frequent patterns from large databases has been an active area of research since it is the most expensive step in association rules mining. In this paper, we pr...
SIGMOD
1996
ACM
14 years 16 days ago
1996
ACM
Finding useful patterns in large datasets has attracted considerable interest recently, and one of the most widely st,udied problems in this area is the identification of clusters...