Sciweavers

2375 search results - page 305 / 475
» Analyze Grid from the Perspective of a Computing System
Sort
View
KDD
2004
ACM
160views Data Mining» more  KDD 2004»
16 years 7 months ago
k-TTP: a new privacy model for large-scale distributed environments
Secure multiparty computation allows parties to jointly compute a function of their private inputs without revealing anything but the output. Theoretical results [2] provide a gen...
Bobi Gilburd, Assaf Schuster, Ran Wolff
SC
2009
ACM
16 years 1 months ago
Implementing sparse matrix-vector multiplication on throughput-oriented processors
Sparse matrix-vector multiplication (SpMV) is of singular importance in sparse linear algebra. In contrast to the uniform regularity of dense linear algebra, sparse operations enc...
Nathan Bell, Michael Garland
TSP
2010
15 years 1 months ago
Quasi-interpolation by means of filter-banks
We consider the problem of approximating a regular function f(t) from its samples, f(nT), taken in a uniform grid. Quasi-interpolation schemes approximate f(t) with a dilated versi...
Gerardo Pérez-Villalón
SC
2003
ACM
15 years 11 months ago
Traffic-based Load Balance for Scalable Network Emulation
Load balance is critical to achieving scalability for large network emulation studies, which are of compelling interest for emerging Grid, Peer to Peer, and other distributed appl...
Xin Liu, Andrew A. Chien
IJFCS
2006
130views more  IJFCS 2006»
15 years 6 months ago
Mealy multiset automata
We introduce the networks of Mealy multiset automata, and study their computational power. The networks of Mealy multiset automata are computationally complete. 1 Learning from Mo...
Gabriel Ciobanu, Viorel Mihai Gontineac