373 search results - page 70 / 75 » Mining time-changing data streams |
STOC
2001
ACM
14 years 7 months ago
2001
ACM
Histograms are typically used to approximate data distributions. Histograms and related synopsis structures have been successful in a wide variety of popular database applications...
NIPS
2008
13 years 9 months ago
2008
Conditional Random Sampling (CRS) was originally proposed for efficiently computing pairwise (l2, l1) distances, in static, large-scale, and sparse data. This study modifies the o...
EUROSSC
2007
Springer
14 years 1 months ago
2007
Springer
We present a new approach for the detection of complex events in Wireless Sensor Networks. Complex events are sets of data points that correspond to interesting or unusual patterns...
SDM
2007
SIAM
13 years 9 months ago
2007
SIAM
In recent years, spectral clustering method has gained attentions because of its superior performance compared to other traditional clustering algorithms such as K-means algorithm...
ITICSE
2004
ACM
14 years 27 days ago
2004
ACM
Final year, group (capstone) projects in computing disciplines are often expected to fill multiple roles: in addition to allowing students to learn important domain-specific knowl...