On Unifying the Space of ℓ0-Sampling Algorithms

نویسندگان

  • Graham Cormode
  • Donatella Firmani
چکیده

The problem of building an `0-sampler is to sample nearuniformly from the support set of a dynamic multiset. This problem has a variety of applications within data analysis, computational geometry and graph algorithms. In this paper, we abstract a set of steps for building an `0-sampler, based on sampling, recovery and selection. We analyze the implementation of an `0-sampler within this framework, and show how prior constructions of `0-samplers can all be expressed in terms of these steps. Our experimental contribution is to provide a first detailed study of the accuracy and computational cost of `0-samplers.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Highly Undersampled Magnetic Resonance Image Reconstruction via Homotopic ℓ0 -Minimization

In clinical magnetic resonance imaging (MRI), any reduction in scan time offers a number of potential benefits ranging from high-temporal-rate observation of physiological processes to improvements in patient comfort. Following recent developments in compressive sensing (CS) theory, several authors have demonstrated that certain classes of MR images which possess sparse representations in some ...

متن کامل

Fixed Point Results on $b$-Metric Space via Picard Sequences and $b$-Simulation Functions

In a recent paper, Khojasteh emph{et al.} [F. Khojasteh, S. Shukla, S. Radenovi'c, A new approach to the study of fixed point theorems via simulation functions, Filomat, 29 (2015), 1189-–1194] presented a new class of simulation functions, say $mathcal{Z}$-contractions, with unifying power over known contractive conditions in the literature. Following this line of research, we extend and ...

متن کامل

Constrained TpV Minimization for Enhanced Exploitation of Gradient Sparsity: Application to CT Image Reconstruction.

Exploiting sparsity in the image gradient magnitude has proved to be an effective means for reducing the sampling rate in the projection view angle in computed tomography (CT). Most of the image reconstruction algorithms, developed for this purpose, solve a nonsmooth convex optimization problem involving the image total variation (TV). The TV seminorm is the ℓ1 norm of the image gradient magnit...

متن کامل

An Efficient Genetic Algorithm for Task Scheduling on Heterogeneous Computing Systems Based on TRIZ

An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013