Univariate Lp and ɭ p Averaging, 0 < p < 1, in Polynomial Time by Utilization of Statistical Structure

We present evidence that one can calculate generically combinatorially expensive Lp and lp averages, 0 < p < 1, in polynomial time by restricting the data to come from a wide class of statistical distributions. Our approach differs from the approaches in the previous literature, which...

Full description

Bibliographic Details
Main Author: John E. Lavery
Format: Article
Language:English
Published: MDPI AG 2012-10-01
Series:Algorithms
Subjects:
Online Access:http://www.mdpi.com/1999-4893/5/4/421