Sciweavers

1933 search results - page 378 / 387
» High-performance computing using accelerators
Sort
View
STACS
1992
Springer
13 years 11 months ago
Speeding Up Two String-Matching Algorithms
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
Maxime Crochemore, Thierry Lecroq, Artur Czumaj, L...
PC
2007
343views Management» more  PC 2007»
13 years 7 months ago
Runtime scheduling of dynamic parallelism on accelerator-based multi-core systems
We explore runtime mechanisms and policies for scheduling dynamic multi-grain parallelism on heterogeneous multi-core processors. Heterogeneous multi-core processors integrate con...
Filip Blagojevic, Dimitrios S. Nikolopoulos, Alexa...
ANCS
2010
ACM
13 years 5 months ago
sNICh: efficient last hop networking in the data center
: sNICh: Efficient Last Hop Networking in the Data Center Kaushik Kumar Ram, Jayaram Mudigonda, Alan L. Cox, Scott Rixner, Partha Ranganathan, Jose Renato Santos HP Laboratories H...
Kaushik Kumar Ram, Jayaram Mudigonda, Alan L. Cox,...
WWW
2004
ACM
14 years 8 months ago
Updating pagerank with iterative aggregation
We present an algorithm for updating the PageRank vector [1]. Due to the scale of the web, Google only updates its famous PageRank vector on a monthly basis. However, the Web chan...
Amy Nicole Langville, Carl Dean Meyer
IJCNN
2008
IEEE
14 years 1 months ago
Learning to select relevant perspective in a dynamic environment
— When an agent observes its environment, there are two important characteristics of the perceived information. One is the relevance of information and the other is redundancy. T...
Zhihui Luo, David A. Bell, Barry McCollum, Qingxia...