Sciweavers

901 search results - page 113 / 181
» Hiding Communication Latency in Data Parallel Applications
Sort
View
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
13 years 12 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
INFOCOM
2009
IEEE
14 years 2 months ago
RADcast: Enabling Reliability Guarantees for Content Dissemination in Ad Hoc Networks
— This paper deals with the problem of reliable and fast broadcast of mission-critical data with rich content over ad hoc networks. Existing approaches to dissemination reliabili...
Bo Xing, Sharad Mehrotra, Nalini Venkatasubramania...
DAC
2008
ACM
13 years 9 months ago
Application mapping for chip multiprocessors
The problem attacked in this paper is one of automatically mapping an application onto a Network-on-Chip (NoC) based chip multiprocessor (CMP) architecture in a locality-aware fas...
Guangyu Chen, Feihui Li, Seung Woo Son, Mahmut T. ...
CCGRID
2004
IEEE
13 years 11 months ago
DWDM-RAM: a data intensive Grid service architecture enabled by dynamic optical networks
Next generation applications and architectures (for example, Grids) are driving radical changes in the nature of traffic, service models, technology, and cost, creating opportunit...
Tal Lavian, Joe Mambretti, Doug Cutrell, Howard J....
KDD
2005
ACM
170views Data Mining» more  KDD 2005»
14 years 8 months ago
Parallel mining of closed sequential patterns
Discovery of sequential patterns is an essential data mining task with broad applications. Among several variations of sequential patterns, closed sequential pattern is the most u...
Shengnan Cong, Jiawei Han, David A. Padua