Sciweavers

36 search results - page 3 / 8
» An Efficient Discrete Log Pseudo Random Generator
Sort
View
FOCS
2009
IEEE
16 years 10 days ago
Faster Generation of Random Spanning Trees
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
Jonathan A. Kelner, Aleksander Madry
122
Voted
JGTOOLS
2006
72views more  JGTOOLS 2006»
15 years 5 months ago
Efficient Generation of Poisson-Disk Sampling Patterns
Poisson Disk sampling patterns are of interest to the graphics community because their blue-noise properties are desirable in sampling patterns for rendering, illumination, and ot...
Thouis R. Jones
SODA
2010
ACM
169views Algorithms» more  SODA 2010»
16 years 3 months ago
Efficiently Decodable Non-adaptive Group Testing
We consider the following "efficiently decodable" nonadaptive group testing problem. There is an unknown string x {0, 1}n with at most d ones in it. We are allowed to t...
Piotr Indyk, Hung Q. Ngo, Atri Rudra
CTRSA
2009
Springer
128views Cryptology» more  CTRSA 2009»
16 years 11 days ago
Short Redactable Signatures Using Random Trees
Abstract. A redactable signature scheme for a string of objects supports verification even if multiple substrings are removed from the original string. It is important that the re...
Ee-Chien Chang, Chee Liang Lim, Jia Xu
CVPR
2010
IEEE
15 years 8 months ago
Ray Markov Random Fields for Image-Based 3D Modeling: Model and Efficient Inference
In this paper, we present an approach to multi-view image-based 3D reconstruction by statistically inversing the ray-tracing based image generation process. The proposed algorithm...
Shubao Liu, David Cooper