6542 search results - page 168 / 1309 » The tao of parallelism in algorithms |
133
click to vote
IPPS
2007
IEEE
16 years 26 days ago
2007
IEEE
Irregular applications, which rely on pointer-based data structures, are often difficult to parallelize. The inputdependent nature of their execution means that traditional paral...
158
click to vote
SIGIR
2006
ACM
16 years 15 days ago
2006
ACM
Pseudo-relevance feedback has proven to be an effective strategy for improving retrieval accuracy in all retrieval models. However the performance of existing pseudo feedback meth...
173
click to vote
EDBTW
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. The Web has been rapidly “deepened” with the prevalence of databases online. On this “deep Web,” numerous sources are structured, providing schema-rich data– Th...
203
click to vote
PDSE
1998
15 years 8 months ago
1998
This paper describes how to reduce the burden of parallel programming by utilizing relevant parallel programs. Parallel algorithms are divided into four classes and a case base fo...
133
click to vote
ATVA
2005
Springer
16 years 3 days ago
2005
Springer
Partitioned BDD-based algorithms have been proposed in the literature to solve the memory explosion problem in BDD-based verification. A naive parallelization of such algorithms ...