195 search results - page 32 / 39 » Surface Approximation and Geometric Partitions |
APPROX
2008
Springer
15 years 1 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 ...
CGI
1999
IEEE
15 years 4 months ago
1999
IEEE
Rendering highly complex models can be time and space prohibitive, and decimation is an important tool in providing simplifications. A decimated model may replace the original ent...
SODA
2010
ACM
15 years 9 months ago
2010
ACM
abstract Subhash Khot Assaf Naor In the kernel clustering problem we are given a (large) n ? n symmetric positive semidefinite matrix A = (aij) with n i=1 n j=1 aij = 0 and a (sma...
128
click to vote
CGF
2007
14 years 11 months ago
2007
We present a novel framework for efficiently computing the indirect illumination in diffuse and moderately glossy scenes using density estimation techniques. Many existing global...
132
click to vote
INFOCOM
2012
IEEE
13 years 2 months ago
2012
IEEE
—A cardinal prerequisite for the system design of a sensor network, is to understand the geometric environment where sensor nodes are deployed. The global topology of a largescal...