1517 search results - page 131 / 304 » Hardening Functions for Large Scale Distributed Computations |
124
Voted
IPPS
2006
IEEE
15 years 10 months ago
2006
IEEE
Inference of phylogenetic trees using the maximum likelihood (ML) method is NP-hard. Furthermore, the computation of the likelihood function for huge trees of more than 1,000 orga...
159
click to vote
IPPS
2005
IEEE
2005
IEEE
A Framework for Partitioning Computational Intensive Applications in Hybrid Reconfigurable Platforms
15 years 10 months ago
In this paper, we describe a prototype software framework that implements a formalized methodology for partitioning computational intensive applications between reconfigurable har...
137
click to vote
KDD
2004
ACM
16 years 5 months ago
2004
ACM
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...
168
Voted
MOBIQUITOUS
2008
IEEE
15 years 11 months ago
2008
IEEE
The big challenge related to the contemporary research on ubiquitous and pervasive computing is that of seamless integration. For the next generation of ubiquitous and distributed...
153
click to vote
IPPS
2003
IEEE
15 years 10 months ago
2003
IEEE
The application of hardware-parameterized models to distributed systems can result in omission of key bottlenecks such as the full cost of inter-node communication in a shared mem...