1517 search results - page 54 / 304 » Hardening Functions for Large Scale Distributed Computations |
148
click to vote
EMNLP
2009
15 years 2 months ago
2009
Computing the pairwise semantic similarity between all words on the Web is a computationally challenging task. Parallelization and optimizations are necessary. We propose a highly...
148
click to vote
CLOUDCOM
2010
Springer
15 years 2 months ago
2010
Springer
Carrying out science at extreme scale is the next generational challenge facing the broad field of scientific research. Cloud computing offers to potential for an increasing number...
161
click to vote
EUROPAR
2009
Springer
15 years 11 months ago
2009
Springer
Recently many large scale computer systems are built in order to meet the high storage and processing demands of compute and data-intensive applications. MapReduce is one of the mo...
143
click to vote
DAC
2008
ACM
16 years 5 months ago
2008
ACM
Boolean function bi-decomposition is a fundamental operation in logic synthesis. A function f(X) is bi-decomposable under a variable partition XA, XB, XC on X if it can be written...
151
Voted
PDP
2007
IEEE
15 years 10 months ago
2007
IEEE
We present an algorithm to compute the cycle structure of large directed graphs where each node has exactly one outgoing edge. Such graphs appear as state diagrams of finite stat...