Sciweavers

337 search results - page 34 / 68
» Run-Time Methods for Parallelizing Partially Parallel Loops
Sort
View
CSL
2007
Springer
13 years 7 months ago
Partially observable Markov decision processes for spoken dialog systems
In a spoken dialog system, determining which action a machine should take in a given situation is a difficult problem because automatic speech recognition is unreliable and hence ...
Jason D. Williams, Steve Young
IPMI
2001
Springer
14 years 8 months ago
Partial Volume Segmentation of Cerebral MRI Scans with Mixture Model Clustering
A mixture model clustering algorithm is presented for robust MRI brain image segmentation in the presence of partial volume averaging. The method uses additional classes to represe...
Aljaz Noe, James C. Gee
IPPS
1997
IEEE
13 years 11 months ago
The Sparse Cyclic Distribution against its Dense Counterparts
Several methods have been proposed in the literature for the distribution of data on distributed memory machines, either oriented to dense or sparse structures. Many of the real a...
Gerardo Bandera, Manuel Ujaldon, María A. T...
CORR
2010
Springer
221views Education» more  CORR 2010»
13 years 7 months ago
Deterministic Sample Sort For GPUs
We present and evaluate GPU Bucket Sort, a parallel deterministic sample sort algorithm for many-core GPUs. Our method is considerably faster than Thrust Merge (Satish et.al., Pro...
Frank Dehne, Hamidreza Zaboli
FSTTCS
2006
Springer
13 years 11 months ago
Computing a Center-Transversal Line
A center-transversal line for two finite point sets in R3 is a line with the property that any closed halfspace that contains it also contains at least one third of each point set...
Pankaj K. Agarwal, Sergio Cabello, Joan Antoni Sel...