Sciweavers

8 search results - page 2 / 2
» Approximating Dense Max 2-CSPs
Sort
View
STOC
2004
ACM
109views Algorithms» more  STOC 2004»
14 years 5 months ago
Approximating the cut-norm via Grothendieck's inequality
The cut-norm ||A||C of a real matrix A = (aij)iR,jS is the maximum, over all I R, J S of the quantity | iI,jJ aij|. This concept plays a major role in the design of efficient app...
Noga Alon, Assaf Naor
CVPR
2009
IEEE
15 years 3 days ago
Isometric Registration of Ambiguous and Partial Data
This paper introduces a new shape matching algorithm for computing correspondences between 3D surfaces that have undergone (approximately) isometric deformations. The new approach ...
Art Tevs (Max Planck Institute Informatik), Martin...
WSCG
2004
133views more  WSCG 2004»
13 years 6 months ago
Diffusion and Multiple Anisotropic Scattering for Global Illumination in Clouds
The diffusion method is a good approximation inside the dense core of a cloud, but not at the more tenuous boundary regions. Also, it breaks down in regions where the density of s...
Nelson Max, Greg Schussman, Ryo Miyazaki, Kei Iwas...