874 search results - page 8 / 175 » Practical Algorithms for Selection on Coarse-Grained Paralle... |
144
click to vote
TC
2010
15 years 1 months ago
2010
—In this paper, we investigate data parallelism in exact inference with respect to arbitrary junction trees. Exact inference is a key problem in exploring probabilistic graphical...
125
Voted
IPPS
1997
IEEE
15 years 7 months ago
1997
IEEE
The range tree is a fundamental data structure for multidimensional point sets, and as such, is central in a wide range of geometric anddatabaseapplications. Inthis paper, we desc...
118
click to vote
HPDC
2002
IEEE
15 years 8 months ago
2002
IEEE
Clusters of workstations have become a cost-effective means of performing scientific computations. However, large network latencies, resource sharing, and heterogeneity found in ...
113
click to vote
ECIR
2009
Springer
16 years 15 days ago
2009
Springer
The aim of query-based sampling is to obtain a sufficient, representative sample of an underlying (text) collection. Current measures for assessing sample quality are too coarse gr...
147
Voted
IPPS
2006
IEEE
15 years 9 months ago
2006
IEEE
In this paper we study the performance improvements and trade-offs derived from an optimized mapping approach applied on a parametric coarse grained reconfigurable array architect...