Sciweavers

7006 search results - page 635 / 1402
» Approximation Algorithms
Sort
View
PODS
2004
ACM
109views Database» more  PODS 2004»
16 years 7 months ago
On the Complexity of Optimal K-Anonymity
The technique of k-anonymization has been proposed in the literature as an alternative way to release public information, while ensuring both data privacy and data integrity. We p...
Adam Meyerson, Ryan Williams
SMI
2006
IEEE
144views Image Analysis» more  SMI 2006»
16 years 1 months ago
Robust Alignment of Multi-view Range Data to CAD Model
Surface matching is a common task in computer graphics and computer vision. In this paper, we introduce a novel algorithm that aligns scanned point-based surfaces to the related 3...
Xinju Li, Igor Guskov, Jacob Barhak
TOMS
2008
87views more  TOMS 2008»
15 years 7 months ago
Efficient Contouring on Unstructured Meshes for Partial Differential Equations
We introduce three fast contouring algorithms for visualizing the solution of Partial Differential Equations based on the PCI (Pure Cubic Interpolant). The PCI is a particular pie...
Hassan Goldani-Moghaddam, Wayne H. Enright
COCOON
2010
Springer
15 years 11 months ago
A Three-String Approach to the Closest String Problem
Given a set of n strings of length L and a radius d, the closest string problem (CSP for short) asks for a string tsol that is within a Hamming distance of d to each of the given ...
Zhi-Zhong Chen, Bin Ma, Lusheng Wang
216
Voted
WINE
2005
Springer
182views Economy» more  WINE 2005»
16 years 28 days ago
Inapproximability Results for Combinatorial Auctions with Submodular Utility Functions
We consider the following allocation problem arising in the setting of combinatorial auctions: a set of goods is to be allocated to a set of players so as to maximize the sum of t...
Subhash Khot, Richard J. Lipton, Evangelos Markaki...