Sciweavers

5785 search results - page 251 / 1157
» Approximability of Probability Distributions
Sort
View
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
16 years 4 months ago
Almost random graphs with simple hash functions
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
Martin Dietzfelbinger, Philipp Woelfel
ICC
2007
IEEE
137views Communications» more  ICC 2007»
15 years 10 months ago
On the Simulation of Tikhonov Random Processes
Abstract— A novel, simple and efficient method for the generation of Tikhonov (a.k.a. von Mises) random variates is proposed. In the proposed method, circular variates of a pres...
Giuseppe Thadeu Freitas de Abreu
IPSN
2007
Springer
15 years 10 months ago
Hierarchical spatial gossip for multi-resolution representations in sensor networks
In this paper we propose a lightweight algorithm for constructing multi-resolution data representations for sensor networks. We compute, at each sensor node u, O(log n) aggregates...
Rik Sarkar, Xianjin Zhu, Jie Gao
DFG
2007
Springer
15 years 10 months ago
Natural Neighbor Concepts in Scattered Data Interpolation and Discrete Function Approximation
: The concept of natural neighbors employs the notion of distance to define local neighborhoods in discrete data. Especially when querying and accessing large scale data, it is im...
Tom Bobach, Georg Umlauf
RT
1999
Springer
15 years 8 months ago
Interactive Rendering with Arbitrary BRDFs using Separable Approximations
A separable decomposition of bidirectional reflectance distributions (BRDFs) is used to implement arbitrary reflectances from point sources on existing graphics hardware. Two-dim...
Jan Kautz, Michael D. McCool