Sciweavers

10533 search results - page 1895 / 2107
» Design in reliability for communication designs
Sort
View
IMC
2010
ACM
15 years 4 months ago
Measuring the mixing time of social graphs
Social networks provide interesting algorithmic properties that can be used to bootstrap the security of distributed systems. For example, it is widely believed that social networ...
Abedelaziz Mohaisen, Aaram Yun, Yongdae Kim
IPPS
2010
IEEE
15 years 4 months ago
Tile QR factorization with parallel panel processing for multicore architectures
To exploit the potential of multicore architectures, recent dense linear algebra libraries have used tile algorithms, which consist in scheduling a Directed Acyclic Graph (DAG) of...
Bilel Hadri, Hatem Ltaief, Emmanuel Agullo, Jack D...
IPPS
2010
IEEE
15 years 4 months ago
Oblivious algorithms for multicores and network of processors
We address the design of algorithms for multicores that are oblivious to machine parameters. We propose HM, a multicore model consisting of a parallel shared-memory machine with hi...
Rezaul Alam Chowdhury, Francesco Silvestri, Brando...
MOBIHOC
2010
ACM
15 years 4 months ago
Globs in the primordial soup: the emergence of connected crowds in mobile wireless networks
In many practical scenarios, nodes gathering at points of interest yield sizable connected components (clusters), which sometimes comprise the majority of nodes. While recent anal...
Simon Heimlicher, Kavé Salamatian
SSS
2010
Springer
160views Control Systems» more  SSS 2010»
15 years 4 months ago
A Comparative Study of Rateless Codes for P2P Persistent Storage
Abstract. This paper evaluates the performance of two seminal rateless erasure codes, LT Codes and Online Codes. Their properties make them appropriate for coping with communicatio...
Heverson Borba Ribeiro, Emmanuelle Anceaume
« Prev « First page 1895 / 2107 Last » Next »