Sciweavers

2634 search results - page 185 / 527
» Faster Than Uppaal
Sort
View
CORR
2010
Springer
221views Education» more  CORR 2010»
15 years 6 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
CORR
2010
Springer
96views Education» more  CORR 2010»
15 years 6 months ago
Learning High-Dimensional Markov Forest Distributions: Analysis of Error Rates
The problem of learning forest-structured discrete graphical models from i.i.d. samples is considered. An algorithm based on pruning of the Chow-Liu tree through adaptive threshol...
Vincent Y. F. Tan, Animashree Anandkumar, Alan S. ...
CORR
2008
Springer
97views Education» more  CORR 2008»
15 years 6 months ago
Fast Density Codes for Image Data
Recently, a new method for encoding data sets in the form of "Density Codes" was proposed in the literature (Courrieu, 2006). This method allows to compare sets of points...
Pierre Courrieu
CORR
2008
Springer
86views Education» more  CORR 2008»
15 years 6 months ago
Fast computation of the median by successive binning
In many important problems, one uses the median instead of the mean to estimate a population's center, since the former is more robust. But in general, computing the median i...
Ryan J. Tibshirani
CORR
2006
Springer
70views Education» more  CORR 2006»
15 years 6 months ago
Scalable Algorithms for Aggregating Disparate Forecasts of Probability
- In this paper, computational aspects of the panel aggregation problem are addressed. Motivated primarily by applications of risk assessment, an algorithm is developed for aggrega...
Joel B. Predd, Sanjeev R. Kulkarni, Daniel N. Oshe...