Sciweavers

5962 search results - page 1077 / 1193
» Efficient Clustering for Orders
Sort
View
KDD
2008
ACM
165views Data Mining» more  KDD 2008»
16 years 6 months ago
Colibri: fast mining of large static and dynamic graphs
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 ...
Hanghang Tong, Spiros Papadimitriou, Jimeng Sun, P...
KDD
2004
ACM
143views Data Mining» more  KDD 2004»
16 years 6 months ago
Incremental maintenance of quotient cube for median
Data cube pre-computation is an important concept for supporting OLAP(Online Analytical Processing) and has been studied extensively. It is often not feasible to compute a complet...
Cuiping Li, Gao Cong, Anthony K. H. Tung, Shan Wan...
OSDI
2004
ACM
16 years 6 months ago
CP-Miner: A Tool for Finding Copy-paste and Related Bugs in Operating System Code
Copy-pasted code is very common in large software because programmers prefer reusing code via copy-paste in order to reduce programming effort. Recent studies show that copy-paste...
Zhenmin Li, Shan Lu, Suvda Myagmar, Yuanyuan Zhou
VLDB
2007
ACM
122views Database» more  VLDB 2007»
16 years 6 months ago
MIST: Distributed Indexing and Querying in Sensor Networks using Statistical Models
The modeling of high level semantic events from low level sensor signals is important in order to understand distributed phenomena. For such content-modeling purposes, transformat...
Arnab Bhattacharya, Anand Meka, Ambuj K. Singh
VLDB
2007
ACM
145views Database» more  VLDB 2007»
16 years 6 months ago
Executing Stream Joins on the Cell Processor
Low-latency and high-throughput processing are key requirements of data stream management systems (DSMSs). Hence, multi-core processors that provide high aggregate processing capa...
Bugra Gedik, Philip S. Yu, Rajesh Bordawekar
« Prev « First page 1077 / 1193 Last » Next »