400 search results - page 10 / 80 » Parallel Algorithms with Optimal Speedup for Bounded Treewid... |
IPPS
2005
IEEE
15 years 3 months ago
2005
IEEE
We present an experimental study of parallel biconnected components algorithms employing several fundamental parallel primitives, e.g., prefix sum, list ranking, sorting, connect...
IPPS
1997
IEEE
15 years 1 months ago
1997
IEEE
Branch-and-bound algorithms are general methods applicable to various combinatorial optimization problems and parallelization is one of the most hopeful methods to improve these a...
ISCAS
2003
IEEE
15 years 2 months ago
2003
IEEE
—This paper presents high-speed parallel Reed–Solomon (RS) (255,239) decoder architecture using modified Euclidean algorithm for the high-speed multigigabit-per-second fiber op...
SPAA
1998
ACM
15 years 1 months ago
1998
ACM
We present parallel algorithms for union, intersection and difference on ordered sets using random balanced binary trees (treaps [26]). For two sets of size n and m (m ≤ n) the...
107
click to vote
AI
2011
Springer
14 years 1 months ago
2011
Springer
Probabilistic inference in graphical models is a prevalent task in statistics and artificial intelligence. The ability to perform this inference task efficiently is critical in l...