Sciweavers

188 search results - page 15 / 38
» Differentially Private Approximation Algorithms
Sort
View
SODA
2010
ACM
215views Algorithms» more  SODA 2010»
14 years 5 months ago
Approximability of Robust Network Design
We consider robust network design problems where the set of feasible demands may be given by an arbitrary polytope or convex body more generally. This model, introduced by BenAmeu...
Neil Olver, F. Bruce Shepherd
ENC
2006
IEEE
13 years 11 months ago
Adaptive Node Refinement Collocation Method for Partial Differential Equations
In this work, by using the local node refinement technique purposed in [2, 1], and a quad-tree type algorithm [3, 13], we built a global refinement technique for Kansa's unsy...
José Antonio Muñoz-Gómez, Ped...
CALC
2001
Springer
171views Cryptology» more  CALC 2001»
14 years 2 days ago
Approximate Integer Common Divisors
We show that recent results of Coppersmith, Boneh, Durfee and Howgrave-Graham actually apply in the more general setting of (partially) approximate common divisors. This leads us t...
Nick Howgrave-Graham
ACSC
2009
IEEE
14 years 2 months ago
Microdata Protection Through Approximate Microaggregation
Microdata protection is a hot topic in the field of Statistical Disclosure Control, which has gained special interest after the disclosure of 658000 queries by the America Online...
Xiaoxun Sun, Hua Wang, Jiuyong Li
PG
2007
IEEE
14 years 1 months ago
Fast and Faithful Geometric Algorithm for Detecting Crest Lines on Meshes
A new geometry-based finite difference method for a fast and reliable detection of perceptually salient curvature extrema on surfaces approximated by dense triangle meshes is pro...
Shin Yoshizawa, Alexander G. Belyaev, Hideo Yokota...