Fast computation of trimmed means

Journal of Statistical Software

Volumn 39, Issue CODE SNIPPET 2, 2011, Pages

  Beliakov, Gleb ^a  

^a DEAKIN UNIVERSITY   (Australia)

Author keywords

Order statistics; Sorting; Trimmed mean; Winsorized mean

Indexed keywords

EID: 80054036654     PISSN: 15487660     EISSN: None     Source Type: Journal    
DOI: 10.18637/jss.v039.c02     Document Type: Article

References (5)

1. Blum M, Floyd RW, Watt V, Rive RL, Tarjan RE (1973). "Time Bounds for Selection." Journal of Computer and System Sciences, 7, 448-461.
2. NVIDIA Corporation (2007). "NVIDIA CUDA SDK Data Parallel Algorithms." Accessed 2010-06-01, URL http://developer.download.nvidia.com/compute/cuda/1_1/Website/Data-Parallel_Algorithms.html.
3. NVIDIA Corporation (2008). "NVIDIA Tesla Personal Supercomputer Tesla Datasheet." Accessed 2010-12-01, URL http://www.nvidia.com/docs/IO/43395/NV_DS_Tesla_PSC_US_Nov08_LowRes.pdf.
4. Press AH, Teukolsky SA, Vetterling WT, Flannery BP (2002). Numerical Recipes in C: The Art of Scientific Computing. Cambridge University Press, New York.
5. Sedgewick R (1988). Algorithms. 2nd edition. Addison-Wesley, Reading, MA.