Sciweavers

35 search results - page 7 / 7
» Pseudorandomness for Approximate Counting and Sampling
Sort
View
PE
2008
Springer
89views Optimization» more  PE 2008»
13 years 5 months ago
Merging and splitting autocorrelated arrival processes and impact on queueing performance
We have proposed a three-parameter renewal approximation to analyze splitting and superposition of autocorrelated processes. We define the index of dispersion for counts of an ord...
Baris Balcioglu, David L. Jagerman, Tayfur Altiok
ICC
2007
IEEE
137views Communications» more  ICC 2007»
13 years 11 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
ICDE
2007
IEEE
111views Database» more  ICDE 2007»
14 years 6 months ago
Proof Sketches: Verifiable In-Network Aggregation
Recent work on distributed, in-network aggregation assumes a benign population of participants. Unfortunately, modern distributed systems are plagued by malicious participants. In...
Minos N. Garofalakis, Joseph M. Hellerstein, Petro...
FOCS
2006
IEEE
13 years 11 months ago
A simple condition implying rapid mixing of single-site dynamics on spin systems
Spin systems are a general way to describe local interactions between nodes in a graph. In statistical mechanics, spin systems are often used as a model for physical systems. In c...
Thomas P. Hayes
CAD
2005
Springer
13 years 5 months ago
Optimizing the topological and combinatorial complexity of isosurfaces
Since the publication of the original Marching Cubes algorithm, numerous variations have been proposed for guaranteeing water-tight constructions of triangulated approximations of...
Carlos Andújar, Pere Brunet, Antoni Chica, ...