Sciweavers

171 search results - page 16 / 35
» Approximation of Discrete Phase-Type Distributions
Sort
View
COMPGEOM
2010
ACM
14 years 14 days ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park
SODA
2010
ACM
157views Algorithms» more  SODA 2010»
14 years 4 months ago
Testing monotone high-dimensional distributions
A monotone distribution P over a (partially) ordered domain assigns higher probability to y than to x if y x in the order. We study several natural problems concerning testing pr...
Ronitt Rubinfeld, Rocco A. Servedio
DC
2010
13 years 7 months ago
Distributed algorithms for ultrasparse spanners and linear size skeletons
We present efficient algorithms for computing very sparse low distortion spanners in distributed networks and prove some non-trivial lower bounds on the tradeoff between time, spar...
Seth Pettie
CIMAGING
2009
145views Hardware» more  CIMAGING 2009»
13 years 8 months ago
Wavelet-based Poisson rate estimation using the Skellam distribution
Owing to the stochastic nature of discrete processes such as photon counts in imaging, real-world data measurements often exhibit heteroscedastic behavior. In particular, time ser...
Keigo Hirakawa, Farhan A. Baqai, Patrick J. Wolfe
COMPGEOM
1996
ACM
13 years 11 months ago
Developing a Practical Projection-Based Parallel Delaunay Algorithm
In this paper we are concerned with developing a practical parallel algorithm for Delaunay triangulation that works well on general distributions, particularly those that arise in...
Guy E. Blelloch, Gary L. Miller, Dafna Talmor