Sciweavers

605 search results - page 99 / 121
» Geometrical Structure of Boosting Algorithm
Sort
View
CGI
1998
IEEE
13 years 12 months ago
Fast Approximate Quantitative Visibility for Complex Scenes
Ray tracing and Monte-Carlo based global illumination, as well as radiosity and other finite-element based global illumination methods, all require repeated evaluation of quantita...
Yiorgos Chrysanthou, Daniel Cohen-Or, Dani Lischin...
STOC
2009
ACM
150views Algorithms» more  STOC 2009»
14 years 8 months ago
Integrality gaps for Sherali-Adams relaxations
We prove strong lower bounds on integrality gaps of Sherali?Adams relaxations for MAX CUT, Vertex Cover, Sparsest Cut and other problems. Our constructions show gaps for Sherali?A...
Moses Charikar, Konstantin Makarychev, Yury Makary...
CGF
2007
157views more  CGF 2007»
13 years 7 months ago
Mesh Segmentation via Spectral Embedding and Contour Analysis
We propose a mesh segmentation algorithm via recursive bisection where at each step, a sub-mesh embedded in 3D is first spectrally projected into the plane and then a contour is ...
Rong Liu, Hao Zhang 0002
DCG
1998
59views more  DCG 1998»
13 years 7 months ago
A Probabilistic Analysis of the Power of Arithmetic Filters
The assumption of real-number arithmetic, which is at the basis of conventional geometric algorithms, has been seriously challenged in recent years, since digital computers do not...
Olivier Devillers, Franco P. Preparata
COMGEO
1999
ACM
13 years 7 months ago
Multiresolution hierarchies on unstructured triangle meshes
The use of polygonal meshes for the representation of highly complex geometric objects has become the de facto standard in most computer graphics applications. Especially triangle...
Leif Kobbelt, Jens Vorsatz, Hans-Peter Seidel