5005 search results - page 434 / 1001 » The Design and Analysis of Parallel Algorithms |
184
click to vote
UAI
2001
15 years 8 months ago
2001
There is increasing interest within the research community in the design and use of recursive probability models. There remains concern about computational complexity costs and th...
187
click to vote
AIRWEB
2007
Springer
15 years 10 months ago
2007
Springer
The early success of link-based ranking algorithms was predicated on the assumption that links imply merit of the target pages. However, today many links exist for purposes other ...
168
click to vote
PODC
2009
ACM
16 years 7 months ago
2009
ACM
In this work we define and study a new model for the caching problem in a heterogeneous wireless network under a flash-crowd scenario. Using non-cooperative game theory, we cast t...
191
click to vote
PDCAT
2007
Springer
16 years 27 days ago
2007
Springer
ct There have been many previous attempts to accelerate MT19937 using FPGAs but we believe that we can substantially improve the previous implementations to develop a higher throug...
250
Voted
LCPC
2009
Springer
15 years 11 months ago
2009
Springer
Programming heterogeneous parallel computer systems is notoriously difficult, but MIMD models have proven to be portable across multi-core processors, clusters, and massively paral...