Sciweavers

895 search results - page 104 / 179
» Approximate convex decomposition
Sort
View
TCC
2012
Springer
218views Cryptology» more  TCC 2012»
13 years 5 months ago
Iterative Constructions and Private Data Release
In this paper we study the problem of approximately releasing the cut function of a graph while preserving differential privacy, and give new algorithms (and new analyses of exis...
Anupam Gupta, Aaron Roth, Jonathan Ullman
AMDO
2004
Springer
15 years 3 months ago
Neuroanatomy Registration: An Algebraic-Topology Based Approach
In this paper, a method for image deformation is presented. It is based upon decomposition of the deformation problem into basic physical laws. Unlike other methods that solve a di...
Layachi Bentabet, Djemel Ziou
CIARP
2004
Springer
15 years 3 months ago
Refined Method for the Fast and Exact Computation of Moment Invariants
Geometric moments have been proven to be a very efficient tool for description and recognition of binary shapes. Numerous methods for effective calculation of image moments have be...
Juan Humberto Sossa Azuela, Jan Flusser
CIA
2008
Springer
14 years 11 months ago
Incrementally Refined Acquaintance Model for Consortia Composition
This paper presents a specific contracting algorithm that contributes to the process of distributed planning and resource allocation in competitive, semi-trusted environments. The ...
Jan Doubek, Jirí Vokrínek, Michal Pe...
DICTA
2003
14 years 11 months ago
Shift-invariance in the Discrete Wavelet Transform
In this paper we review a number of approaches to reducing, or removing, the problem of shift variance in the discrete wavelet transform (DWT). We describe a generalization of the ...
Andrew P. Bradley