Sciweavers

344 search results - page 7 / 69
» Streaming Algorithms for extent problems in high dimensions
Sort
View
DIALM
2005
ACM
104views Algorithms» more  DIALM 2005»
13 years 9 months ago
Information dissemination in highly dynamic graphs
We investigate to what extent flooding and routing is possible if the graph is allowed to change unpredictably at each time step. We study what minimal requirements are necessary...
Regina O'Dell, Roger Wattenhofer
SDM
2009
SIAM
164views Data Mining» more  SDM 2009»
14 years 4 months ago
Time-Decayed Correlated Aggregates over Data Streams.
Data stream analysis frequently relies on identifying correlations and posing conditional queries on the data after it has been seen. Correlated aggregates form an important examp...
Graham Cormode, Srikanta Tirthapura, Bojian Xu
ARC
2012
Springer
317views Hardware» more  ARC 2012»
12 years 3 months ago
A High Throughput FPGA-Based Implementation of the Lanczos Method for the Symmetric Extremal Eigenvalue Problem
Iterative numerical algorithms with high memory bandwidth requirements but medium-size data sets (matrix size ∼ a few 100s) are highly appropriate for FPGA acceleration. This pap...
Abid Rafique, Nachiket Kapre, George A. Constantin...
ESA
2003
Springer
96views Algorithms» more  ESA 2003»
14 years 21 days ago
Streaming Geometric Optimization Using Graphics Hardware
In this paper we propose algorithms for solving a variety of geometric optimization problems on a stream of points in R2 or R3 . These problems include various extent measures (e.g...
Pankaj K. Agarwal, Shankar Krishnan, Nabil H. Must...
KDD
2012
ACM
178views Data Mining» more  KDD 2012»
11 years 10 months ago
Mining emerging patterns by streaming feature selection
Building an accurate emerging pattern classifier with a highdimensional dataset is a challenging issue. The problem becomes even more difficult if the whole feature space is unava...
Kui Yu, Wei Ding 0003, Dan A. Simovici, Xindong Wu