874 search results - page 8 / 175 » Practical Algorithms for Selection on Coarse-Grained Paralle... |
TC
2010
13 years 6 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...
IPPS
1997
IEEE
13 years 11 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...
HPDC
2002
IEEE
14 years 15 days 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 ...
ECIR
2009
Springer
14 years 4 months 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...
IPPS
2006
IEEE
14 years 1 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...