Sciweavers

226 search results - page 23 / 46
» Approximate Clustering on Distributed Data Streams
Sort
View
KDD
2004
ACM
137views Data Mining» more  KDD 2004»
14 years 1 months ago
Mining scale-free networks using geodesic clustering
Many real-world graphs have been shown to be scale-free— vertex degrees follow power law distributions, vertices tend to cluster, and the average length of all shortest paths is...
Andrew Y. Wu, Michael Garland, Jiawei Han
HPDC
2008
IEEE
13 years 7 months ago
Code coverage, performance approximation and automatic recognition of idioms in scientific applications
Basic data flow patterns which we call idioms, such as stream, transpose, reduction, random access and stencil, are common in scientific numerical applications. We hypothesize tha...
Jiahua He, Allan Snavely, Rob F. Van der Wijngaart...
ICDCS
2005
IEEE
14 years 1 months ago
Optimal Component Composition for Scalable Stream Processing
Stream processing has become increasingly important with emergence of stream applications such as audio/video surveillance, stock price tracing, and sensor data analysis. A challe...
Xiaohui Gu, Philip S. Yu, Klara Nahrstedt
RIDE
1998
IEEE
13 years 12 months ago
Performance Enhancement Using Intra-server Caching in a Continuous Media Server
Continuity of stream playback is the crucial constraint in designing a continuous media server. From a distributed memory architectural model developed earlier, we found that ther...
Chutimet Srinilta, Alok N. Choudhary
CLUSTER
2008
IEEE
14 years 2 months ago
SPRAT: Runtime processor selection for energy-aware computing
—A commodity personal computer (PC) can be seen as a hybrid computing system equipped with two different kinds of processors, i.e. CPU and a graphics processing unit (GPU). Since...
Hiroyuki Takizawa, Katsuto Sato, Hiroaki Kobayashi