Sciweavers

1469 search results - page 155 / 294
» Approximate polynomial decomposition
Sort
View
CGF
1998
134views more  CGF 1998»
15 years 4 months ago
Progressive Iso-Surface Extraction from Hierarchical 3D Meshes
A multiresolution data decomposition offers a fundamental framework supporting compression, progressive transmission, and level-of-detail (LOD) control for large two or three dime...
Wenli Cai, Georgios Sakas, Roberto Grosso, Thomas ...
PC
2010
101views Management» more  PC 2010»
14 years 12 months ago
An efficient parallel implementation of the MSPAI preconditioner
We present an efficient implementation of the Modified SParse Approximate Inverse (MSPAI) preconditioner. MSPAI generalizes the class of preconditioners based on Frobenius norm mi...
Thomas Huckle, A. Kallischko, A. Roy, M. Sedlacek,...
TCC
2012
Springer
218views Cryptology» more  TCC 2012»
14 years 20 days ago
Iterative Constructions and Private Data Release
In this paper we study the problem of approximately releasing the cut function of a graph while preserving differential privacy, and give new algorithms (and new analyses of exis...
Anupam Gupta, Aaron Roth, Jonathan Ullman
CVPR
2007
IEEE
16 years 7 months ago
An Efficient Minimal Solution for Infinitesimal Camera Motion
Given five motion vectors observed in a calibrated camera, what is the rotational and translational velocity of the camera? This problem is the infinitesimal motion analogue to th...
Chris Engels, David Nistér, Henrik Stew&eac...
STOC
2007
ACM
181views Algorithms» more  STOC 2007»
16 years 5 months ago
How to rank with few errors
We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on tournaments. A simple weighted generalization gives a PTAS for KemenyYoung ran...
Claire Kenyon-Mathieu, Warren Schudy