Sciweavers

1576 search results - page 13 / 316
» Streaming Algorithms for Independent Sets
Sort
View
MPC
1995
Springer
150views Mathematics» more  MPC 1995»
15 years 1 months ago
Architecture Independent Massive Parallelization of Divide-and-Conquer Algorithms
Abstract. We present a strategy to develop, in a functional setting, correct, e cient and portable Divide-and-Conquer (DC) programs for massively parallel architectures. Starting f...
Klaus Achatz, Wolfram Schulte
ICS
2007
Tsinghua U.
15 years 3 months ago
Tradeoff between data-, instruction-, and thread-level parallelism in stream processors
This paper explores the scalability of the Stream Processor architecture along the instruction-, data-, and thread-level parallelism dimensions. We develop detailed VLSI-cost and ...
Jung Ho Ahn, Mattan Erez, William J. Dally
ICDM
2010
IEEE
115views Data Mining» more  ICDM 2010»
14 years 7 months ago
Polishing the Right Apple: Anytime Classification Also Benefits Data Streams with Constant Arrival Times
Classification of items taken from data streams requires algorithms that operate in time sensitive and computationally constrained environments. Often, the available time for class...
Jin Shieh, Eamonn J. Keogh
ISPASS
2008
IEEE
15 years 4 months ago
Independent Component Analysis and Evolutionary Algorithms for Building Representative Benchmark Subsets
— This work addresses the problem of building representative subsets of benchmarks from an original large set of benchmarks, using statistical analysis techniques. The subsets sh...
Vassilios N. Christopoulos, David J. Lilja, Paul R...
ICTAI
2009
IEEE
15 years 4 months ago
FlockStream: A Bio-Inspired Algorithm for Clustering Evolving Data Streams
Existing density-based data stream clustering algorithms use a two-phase scheme approach consisting of an online phase, in which raw data is processed to gather summary statistics...
Agostino Forestiero, Clara Pizzuti, Giandomenico S...