Sciweavers

188 search results - page 10 / 38
» Differentially Private Approximation Algorithms
Sort
View
COMGEO
1999
ACM
13 years 7 months ago
Optimal triangulation and quadric-based surface simplification
Many algorithms for reducing the number of triangles in a surface model have been proposed, but to date there has been little theoretical analysis of the approximations they produ...
Paul S. Heckbert, Michael Garland
SIGECOM
2004
ACM
134views ECommerce» more  SIGECOM 2004»
14 years 1 months ago
Computing approximate bayes-nash equilibria in tree-games of incomplete information
We provide efficient algorithms for finding approximate BayesNash equilibria (BNE) in graphical, specifically tree, games of incomplete information. In such games an agent’s p...
Satinder P. Singh, Vishal Soni, Michael P. Wellman
SODA
2010
ACM
201views Algorithms» more  SODA 2010»
14 years 5 months ago
Incentive Compatible Budget Elicitation in Multi-unit Auctions
In this paper, we consider the problem of designing incentive compatible auctions for multiple (homogeneous) units of a good, when bidders have private valuations and private budg...
Sayan Bhattacharya, Vincent Conitzer, Kamesh Munag...
TIP
2008
168views more  TIP 2008»
13 years 7 months ago
A Real-Time Algorithm for the Approximation of Level-Set-Based Curve Evolution
Abstract--In this paper, we present a complete and practical algorithm for the approximation of level-set-based curve evolution suitable for real-time implementation. In particular...
Yonggang Shi, William Clement Karl
CG
2002
Springer
13 years 7 months ago
Robust adaptive polygonal approximation of implicit curves
We present an algorithm for computing a robust adaptive polygonal approximation of an implicit curve in the plane. The approximation is adapted to the geometry of the curve because...
Hélio Lopes, João Batista S. de Oliv...