Sciweavers

257 search results - page 13 / 52
» An Approximate L1-Difference Algorithm for Massive Data Stre...
Sort
View
PPSC
1993
14 years 11 months ago
Parallel Preconditioning and Approximate Inverses on the Connection Machine
We present a new approach to preconditioning for very large, sparse, non-symmetric, linear systems. We explicitly compute an approximate inverse to our original matrix that can be...
Marcus J. Grote, Horst D. Simon
CORR
2010
Springer
138views Education» more  CORR 2010»
14 years 9 months ago
Data Stream Clustering: Challenges and Issues
Very large databases are required to store massive amounts of data that are continuously inserted and queried. Analyzing huge data sets and extracting valuable pattern in many appl...
Madjid Khalilian, Norwati Mustapha
178
Voted
SIGMOD
2005
ACM
220views Database» more  SIGMOD 2005»
15 years 9 months ago
Sampling Algorithms in a Stream Operator
Complex queries over high speed data streams often need to rely on approximations to keep up with their input. The research community has developed a rich literature on approximat...
Theodore Johnson, S. Muthukrishnan, Irina Rozenbau...
JDCTA
2010
119views more  JDCTA 2010»
14 years 4 months ago
Distributed Dual Cluster Algorithm Based on Grid for Sensor Streams
In practical applications, Wireless Sensor Networks generate massive data streams with the dual attributes in geography and optimization domain. Energy source of sensor nodes in W...
Jianghua Huang, Junying Zhang
STOC
2005
ACM
143views Algorithms» more  STOC 2005»
15 years 10 months ago
Optimal approximations of the frequency moments of data streams
We give a 1-pass ~O(m1-2/k )-space algorithm for computing the k-th frequency moment of a data stream for any real k > 2. Together with the lower bounds of [1, 2, 4], this reso...
Piotr Indyk, David P. Woodruff