1082 search results - page 97 / 217 » Approximation Algorithms for Spreading Points |
162
Voted
PPOPP
2011
ACM
14 years 5 months ago
2011
ACM
The sparse grid discretization technique enables a compressed representation of higher-dimensional functions. In its original form, it relies heavily on recursion and complex data...
121
Voted
GRAPHICSINTERFACE
2004
15 years 4 months ago
2004
We present a novel algorithm for accurate, high quality point rendering, which is based on the formulation of splatting using homogeneous coordinates. In contrast to previous meth...
106
Voted
CORR
2004
Springer
15 years 2 months ago
2004
Springer
The Fibonacci dimension fdim(G) of a graph G is introduced as the smallest integer f such that G admits an isometric embedding into f , the f-dimensional Fibonacci cube. We give b...
123
Voted
JAIR
2011
14 years 5 months ago
2011
We address the problem of computing approximate marginals in Gaussian probabilistic models by using mean field and fractional Bethe approximations. We define the Gaussian fracti...
116
Voted
APPROX
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. We are interested in efficient algorithms for generating random samples from geometric objects such as Riemannian manifolds. As a step in this direction, we consider the ...