Sciweavers

25 search results - page 4 / 5
» Handling Non-linear Polynomial Queries over Dynamic Data
Sort
View
ICDE
2008
IEEE
195views Database» more  ICDE 2008»
14 years 9 months ago
Scalable Rule-Based Gene Expression Data Classification
Abstract-- Current state-of-the-art association rule-based classifiers for gene expression data operate in two phases: (i) Association rule mining from training data followed by (i...
Mark A. Iwen, Willis Lang, Jignesh M. Patel
DASFAA
2005
IEEE
256views Database» more  DASFAA 2005»
14 years 1 months ago
CoCache: Query Processing Based on Collaborative Caching in P2P Systems
Peer-to-peer (P2P) computing is gaining more and more significance due to its widespread use currently and potential deployments in future applications. In this paper, we propose ...
Weining Qian, Linhao Xu, Shuigeng Zhou, Aoying Zho...
PAKDD
2004
ACM
137views Data Mining» more  PAKDD 2004»
14 years 1 months ago
Fast and Light Boosting for Adaptive Mining of Data Streams
Supporting continuous mining queries on data streams requires algorithms that (i) are fast, (ii) make light demands on memory resources, and (iii) are easily to adapt to concept dr...
Fang Chu, Carlo Zaniolo
SIGMOD
2009
ACM
171views Database» more  SIGMOD 2009»
14 years 8 months ago
GAMPS: compressing multi sensor data by grouping and amplitude scaling
We consider the problem of collectively approximating a set of sensor signals using the least amount of space so that any individual signal can be efficiently reconstructed within...
Sorabh Gandhi, Suman Nath, Subhash Suri, Jie Liu
STOC
2010
ACM
170views Algorithms» more  STOC 2010»
14 years 11 hour ago
Connectivity oracles for failure prone graphs
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
Ran Duan, Seth Pettie