Sciweavers

2223 search results - page 227 / 445
» Ontological Framework for Approximation
Sort
View
162
Voted
MP
1998
109views more  MP 1998»
15 years 5 months ago
Rounding algorithms for covering problems
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
Dimitris Bertsimas, Rakesh V. Vohra
CG
2011
Springer
15 years 14 days ago
Exoskeleton: Curve network abstraction for 3D shapes
TON: Curve Network Abstraction for 3D Shapes Fernando de Goesa,∗ , Siome Goldensteinb , Mathieu Desbruna , Luiz Velhoc aCalifornia Institute of Technology, Pasadena, CA 91125, US...
Fernando de Goes, Siome Goldenstein, Mathieu Desbr...
CVPR
2012
IEEE
13 years 7 months ago
Geometric understanding of point clouds using Laplace-Beltrami operator
In this paper, we propose a general framework for approximating differential operator directly on point clouds and use it for geometric understanding on them. The discrete approxi...
Jian Liang, Rongjie Lai, Tsz Wai Wong, Hongkai Zha...
PAMI
2008
145views more  PAMI 2008»
15 years 5 months ago
Latent-Space Variational Bayes
Variational Bayesian Expectation-Maximization (VBEM), an approximate inference method for probabilistic models based on factorizing over latent variables and model parameters, has ...
JaeMo Sung, Zoubin Ghahramani, Sung Yang Bang
SODA
2010
ACM
174views Algorithms» more  SODA 2010»
15 years 3 months ago
Differentially Private Combinatorial Optimization
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
Anupam Gupta, Katrina Ligett, Frank McSherry, Aaro...