2358 search results - page 226 / 472 » Revisiting communication performance models for computationa... |
187
click to vote
CRYPTO
2007
Springer
16 years 23 days ago
2007
Springer
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...
217
click to vote
CVPR
2005
IEEE
16 years 8 months ago
2005
IEEE
In [1], three popular subspace face recognition methods, PCA, Bayes, and LDA were analyzed under the same framework and an unified subspace analysis was proposed. However, since t...
176
click to vote
INFOCOM
2008
IEEE
16 years 1 months ago
2008
IEEE
—In a wireless network with node exclusive spectrum sharing, two popular schedules are maximum weight matching (MWM) schedule and maximum size matching (MSM) schedule. The former...
167
click to vote
PPOPP
2005
ACM
16 years 4 days ago
2005
ACM
In this paper, we develop a new language construct to address one of the pitfalls of parallel programming: precise handling of events across parallel components. The construct, te...
192
click to vote
EUROPAR
2009
Springer
15 years 11 months ago
2009
Springer
Data access in HPC infrastructures is realized via user-level networking and OS-bypass techniques through which nodes can communicate with high bandwidth and low-latency. Virtualiz...