400 search results - page 22 / 80 » Parallel Algorithms with Optimal Speedup for Bounded Treewid... |
DAC
2009
ACM
16 years 25 days ago
2009
ACM
Computational complexity has been the primary challenge of many VLSI CAD applications. The emerging multicore and manycore microprocessors have the potential to offer scalable perf...
EOR
2007
14 years 11 months ago
2007
In this paper, we suggest a parallel algorithm based on a shared memory SIMD architecture for solving an n item subset-sum problem in time O(2n/2 /p) by using p = 2q processors, 0...
IPPS
2009
IEEE
15 years 6 months ago
2009
IEEE
In this paper we present the results of parallelizing two life sciences applications, Markov random fieldsbased (MRF) liver segmentation and HMMER’s Viterbi algorithm, using GP...
ISBI
2008
IEEE
16 years 17 days ago
2008
IEEE
We address the problem of fast and accurate localization of miniature surgical instruments like needles or electrodes using 3D ultrasound (US). An algorithm based on maximizing a ...
104
click to vote
ATAL
2005
Springer
15 years 5 months ago
2005
Springer
Agents or agent teams deployed to assist humans often face the challenges of monitoring the state of key processes in their environment (including the state of their human users t...