Sciweavers

692 search results - page 66 / 139
» BDD minimization for approximate computing
Sort
View
SODA
2010
ACM
174views Algorithms» more  SODA 2010»
14 years 9 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...
CVPR
2008
IEEE
16 years 1 months ago
Conjugate rotation: Parameterization and estimation from an affine feature correspondence
When rotating a pinhole camera, images are related by the infinite homography KRK-1 , which is algebraically a conjugate rotation. Although being a very common image transformatio...
Christian Beder, Kevin Köser, Reinhard Koch
95
Voted
CVPR
2008
IEEE
16 years 1 months ago
Multi-label image segmentation via point-wise repetition
Bottom-up segmentation tends to rely on local features. Yet, many natural and man-made objects contain repeating elements. Such structural and more spread-out features are importa...
Gang Zeng, Luc J. Van Gool
FCT
2007
Springer
15 years 2 months ago
Multi-dimensional Packing with Conflicts
We study the multi-dimensional version of the bin packing problem with conflicts. We are given a set of squares V = {1, 2, . . . , n} with sides s1, s2, . . . , sn [0, 1] and a co...
Leah Epstein, Asaf Levin, Rob van Stee
PG
2003
IEEE
15 years 4 months ago
From a Closed Piecewise Geodesic to a Constriction on a Closed Triangulated Surface
Constrictions on a surface are defined as simple closed curves whose length is locally minimal. In particular, constrictions are periodic geodesics. We use constrictions in order...
Franck Hétroy, Dominique Attali