5494 search results - page 936 / 1099 » E-services Management Requirements |
166
click to vote
HPCA
2009
IEEE
16 years 7 months ago
2009
IEEE
Linked data structure (LDS) accesses are critical to the performance of many large scale applications. Techniques have been proposed to prefetch such accesses. Unfortunately, many...
187
click to vote
KDD
2008
ACM
16 years 6 months ago
2008
ACM
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
193
click to vote
KDD
2007
ACM
16 years 6 months ago
2007
ACM
In recent years, the proliferation of VOIP data has created a number of applications in which it is desirable to perform quick online classification and recognition of massive voi...
187
click to vote
KDD
2006
ACM
16 years 6 months ago
2006
ACM
How do we find a natural clustering of a real world point set, which contains an unknown number of clusters with different shapes, and which may be contaminated by noise? Most clu...
187
click to vote
KDD
2005
ACM
16 years 6 months ago
2005
ACM
While scalable data mining methods are expected to cope with massive Web data, coping with evolving trends in noisy data in a continuous fashion, and without any unnecessary stopp...