Sciweavers

4797 search results - page 197 / 960
» The complexity of partition tasks
Sort
View
KDD
2012
ACM
221views Data Mining» more  KDD 2012»
13 years 8 months ago
Fast mining and forecasting of complex time-stamped events
Given huge collections of time-evolving events such as web-click logs, which consist of multiple attributes (e.g., URL, userID, timestamp), how do we find patterns and trends? Ho...
Yasuko Matsubara, Yasushi Sakurai, Christos Falout...
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
16 years 6 months ago
Turning CARTwheels: an alternating algorithm for mining redescriptions
We present an unusual algorithm involving classification trees-CARTwheels--where two trees are grown in opposite directions so that they are joined at their leaves. This approach ...
Naren Ramakrishnan, Deept Kumar, Bud Mishra, Malco...
CIDM
2007
IEEE
16 years 23 days ago
Scalable Clustering for Large High-Dimensional Data Based on Data Summarization
Clustering large data sets with high dimensionality is a challenging data-mining task. This paper presents a framework to perform such a task efficiently. It is based on the notio...
Ying Lai, Ratko Orlandic, Wai Gen Yee, Sachin Kulk...
SC
2003
ACM
15 years 11 months ago
A Compiler Analysis of Interprocedural Data Communication
This paper presents a compiler analysis for data communication for the purpose of transforming ordinary programs into ones that run on distributed systems. Such transformations ha...
Yonghua Ding, Zhiyuan Li
ICC
1997
IEEE
110views Communications» more  ICC 1997»
15 years 10 months ago
Optimizing Resource Utilization in Wireless Multimedia Networks
The task of supporting integrated multi-rate multimedia traffic in a bandwidth poor wireless environment poses a unique and challenging problem for network managers. In this paper...
Paramvir Bahl, Imrich Chlamtac, András Fara...