2342 search results - page 85 / 469 » Sublinear geometric algorithms |
103
Voted
STOC
2009
ACM
16 years 1 months ago
2009
ACM
An affine disperser over Fn 2 for sources of dimension d is a function f : Fn 2 F2 such that for any affine space S Fn 2 of dimension at least d, we have {f(s) : s S} = F2. Aff...
97
Voted
WADS
2007
Springer
15 years 6 months ago
2007
Springer
Distance oracles and graph spanners are excerpts of a graph that allow to compute approximate shortest paths. Here, we consider the situation where it is possible to access the ori...
99
Voted
RT
1999
Springer
15 years 5 months ago
1999
Springer
Abstract. An algorithm for simulating diffuse interreflection in complex three dimensional scenes is described. It combines techniques from hierarchical radiosity and multiresolut...
127
Voted
INFOCOM
2012
IEEE
13 years 3 months ago
2012
IEEE
—Thorup-Zwick (TZ) compact routing guarantees sublinear state growth with the size of the network by routing via landmarks and incurring some path stretch. It uses a pseudo-rando...
95
Voted
ICIP
2000
IEEE
16 years 2 months ago
2000
IEEE
We introduce a sparse image representation that takes advantage of the geometrical regularity of edges in images. A new class of one-dimensional wavelet orthonormal bases, called ...