Sciweavers

91 search results - page 4 / 19
» On random points in the unit disk
Sort
View
ESA
2004
Springer
97views Algorithms» more  ESA 2004»
14 years 2 months ago
Radio Network Clustering from Scratch
Abstract. We propose a novel randomized algorithm for computing a dominating set based clustering in wireless ad-hoc and sensor networks. The algorithm works under a model which ca...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
CEC
2008
IEEE
14 years 3 months ago
A fast high quality pseudo random number generator for graphics processing units
—Limited numerical precision of nVidia GeForce 8800 GTX and other GPUs requires careful implementation of PRNGs. The Park-Miller PRNG is programmed using G80’s native Value4f ï...
William B. Langdon
IM
2008
13 years 8 months ago
Fast and Efficient Restricted Delaunay Triangulation in Random Geometric Graphs
Let G = G(n, r) be a random geometric graph resulting from placing n nodes uniformly at random in the unit square (disk) and connecting every two nodes if and only if their Euclide...
Chen Avin
JSCIC
2010
134views more  JSCIC 2010»
13 years 3 months ago
Radial Basis Function Interpolation on Irregular Domain through Conformal Transplantation
Abstract In this paper, Radial Basis Function (RBF) method for interpolating two dimensional functions with localized features defined on irregular domain is presented. RBF points ...
Alfa R. H. Heryudono, Tobin A. Driscoll
ALGORITHMICA
2007
117views more  ALGORITHMICA 2007»
13 years 8 months ago
Random Geometric Graph Diameter in the Unit Ball
The unit ball random geometric graph G = Gd p(λ, n) has as its vertices n points distributed independently and uniformly in the unit ball in Rd, with two vertices adjacent if and ...
Robert B. Ellis, Jeremy L. Martin, Catherine H. Ya...