𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Output-sensitive algorithms for Tukey depth and related problems

✍ Scribed by David Bremner; Dan Chen; John Iacono; Stefan Langerman; Pat Morin

Publisher
Springer US
Year
2008
Tongue
English
Weight
349 KB
Volume
18
Category
Article
ISSN
0960-3174

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Parallel Output-Sensitive Algorithms for
Parallel Output-Sensitive Algorithms for Combinatorial and Linear Algebra Problems
✍ John H. Reif πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 160 KB

This paper gives output-sensitive parallel algorithms whose performance depends on the output size and are significantly more efficient tan previous algorithms for problems with sufficiently small output size. Inputs are n\_n matrices over a fixed ground field. Let P(n) and M(n) be the PRAM processo

Faster output-sensitive parallel algorit
Faster output-sensitive parallel algorithms for 3D convex hulls and vector maxima
✍ Neelima Gupta; Sandeep Sen πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 263 KB

In this paper we focus on the problem of designing very fast parallel algorithms for the convex hull and the vector maxima problems in three dimensions that are output-size sensitive. Our algorithms achieve Oðlog log 2 n log hÞ parallel time and optimal Oðn log hÞ work with high probability in the C

Systolic algorithm for polynomial interp
Systolic algorithm for polynomial interpolation and related problems
✍ H. Schroder; V.K. Murthy; E.V. Krishnamurthy πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 362 KB

This paper describes a systolic algorithm for interpolation and evaluation of polynomials over any field using a linear array of processors. The periods of these algorithms are O(n) for interpolatin and O(1) for evaluation. This algorithm is readily adapted for Chinese remaindering, easily generahze