Sciweavers

1490 search results - page 93 / 298
» Models and Algorithms for Optical and Optoelectronic Paralle...
Sort
View
CVHI
2007
13 years 9 months ago
SUBPAL: A Device for Reading Aloud Subtitles from Television and Cinema
: The primary focus of this paper is accessibility barriers for visually impaired people and people with dyslexia. Due to their disability a segment of these people have limited ac...
Simon Nielsen, Hans-Heinrich Bothe
SPAA
1995
ACM
13 years 11 months ago
Parallel Sorting with Limited Bandwidth
We study the problem of sorting on a parallel computer with limited communication bandwidth. By using the PRAM(m) model, where p processors communicate through a globally shared me...
Micah Adler, John W. Byers, Richard M. Karp
ISAAC
1997
Springer
162views Algorithms» more  ISAAC 1997»
14 years 3 days ago
A Randomized Linear Work EREW PRAM Algorithm to Find a Minimum Spanning Forest
We present a randomized EREW PRAM algorithm to nd a minimum spanning forest in a weighted undirected graph. On an n-vertex graph the algorithm runs in o((logn)1+ ) expected time f...
Chung Keung Poon, Vijaya Ramachandran
IPPS
2009
IEEE
14 years 2 months ago
Work-first and help-first scheduling policies for async-finish task parallelism
Multiple programming models are emerging to address an increased need for dynamic task parallelism in applications for multicore processors and shared-address-space parallel compu...
Yi Guo, Rajkishore Barik, Raghavan Raman, Vivek Sa...
SPAA
2005
ACM
14 years 1 months ago
Parallelizing time with polynomial circuits
We study the problem of asymptotically reducing the runtime of serial computations with circuits of polynomial size. We give an algorithmic size-depth tradeoff for parallelizing ...
Ryan Williams