Sciweavers

59
Voted
JGTOOLS
2006
72views more  JGTOOLS 2006»
14 years 8 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
COCOON
2008
Springer
14 years 10 months ago
The Computational Complexity of Link Building
We study the problem of adding k new links to a directed graph G(V, E) in order to maximize the minimum PageRank value for a given subset of the nodes. We show that this problem is...
Martin Olsen
FOCS
2004
IEEE
15 years 16 days ago
Testing Low-Degree Polynomials over Prime Fields
We present an efficient randomized algorithm to test if a given function f : Fn p Fp (where p is a prime) is a low-degree polynomial. This gives a local test for Generalized Reed...
Charanjit S. Jutla, Anindya C. Patthak, Atri Rudra...