5005 search results - page 602 / 1001 » The Design and Analysis of Parallel Algorithms |
167
Voted
FSE
2008
Springer
15 years 8 months ago
2008
Springer
We propose SWIFFT, a collection of compression functions that are highly parallelizable and admit very efficient implementations on modern microprocessors. The main technique under...
172
click to vote
PPSC
1997
15 years 8 months ago
1997
It seems likely that improvements in arithmetic speed will continue to outpace advances in communication bandwidth. Furthermore, as more and more problems are working on huge datas...
199
click to vote
EUROPAR
2010
Springer
15 years 8 months ago
2010
Springer
In a Cyclic Mobile Ad Hoc Network (CMANET) where nodes move cyclically, we formulate trust management problems and propose the cTrust scheme to handle trust establishment and aggre...
233
click to vote
SDM
2012
SIAM
13 years 9 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...
156
click to vote
MOBIHOC
2008
ACM
16 years 6 months ago
2008
ACM
As RFID tags are increasingly attached to everyday items, it quickly becomes impractical to collect data from every tag in order to extract useful information. In this paper, we c...