432 search results - page 57 / 87 » Internally deterministic parallel algorithms can be fast |
109
click to vote
BMCBI
2008
15 years 2 months ago
2008
Background: One of the difficulties in mapping biomedical named entities, e.g. genes, proteins, chemicals and diseases, to their concept identifiers stems from the potential varia...
IPPS
2003
IEEE
15 years 7 months ago
2003
IEEE
One of the most important issues to deal with in peerto-peer networks is how to disseminate information. In this paper, we use a completely new approach to solving the information...
111
Voted
PODC
2010
ACM
15 years 5 months ago
2010
ACM
We define two new classes of shared-memory objects: ratifiers, which detect agreement, and conciliators, which ensure agreement with some probability. We show that consensus can...
150
click to vote
SDM
2012
SIAM
13 years 4 months ago
2012
SIAM
Kernel summations are a ubiquitous key computational bottleneck in many data analysis methods. In this paper, we attempt to marry, for the first time, the best relevant technique...
98
Voted
CISIS
2008
IEEE
15 years 8 months ago
2008
IEEE
Parallel algorithms divide computation among several threads. In many cases, the input must also be divided. Consider an input consisting of a linear sequence of elements whose le...