Sciweavers

1046 search results - page 137 / 210
» Approximation Algorithms for Domination Search
Sort
View
ECCC
2010
78views more  ECCC 2010»
15 years 3 months ago
PCPs and the Hardness of Generating Synthetic Data
Assuming the existence of one-way functions, we show that there is no polynomial-time, differentially private algorithm A that takes a database D ({0, 1}d )n and outputs a "...
Jonathan Ullman, Salil P. Vadhan
STOC
2012
ACM
272views Algorithms» more  STOC 2012»
13 years 5 months ago
The cell probe complexity of dynamic range counting
In this paper we develop a new technique for proving lower bounds on the update time and query time of dynamic data structures in the cell probe model. With this technique, we pro...
Kasper Green Larsen
MMSP
2008
IEEE
216views Multimedia» more  MMSP 2008»
15 years 9 months ago
Using stochastic gradient-descent scheme in appearance model based face tracking
— Active appearance model (AAM) has been widely used in face tracking and recognition. However, accuracy and efficiency are always two main challenges with the AAM search. The pa...
Zhidong Li, Jing Chen, Adrian Chong, Zhenghua Yu, ...
CANS
2011
Springer
292views Cryptology» more  CANS 2011»
14 years 3 months ago
Breaking Fully-Homomorphic-Encryption Challenges
At EUROCRYPT ’10, van Dijk, Gentry, Halevi and Vaikuntanathan presented simple fully-homomorphic encryption (FHE) schemes based on the hardness of approximate integer common div...
Phong Q. Nguyen
CP
2006
Springer
15 years 7 months ago
Dynamic Symmetry Breaking Restarted
ion of a given partial assignment of values to variables. Compared with other symmetry breaking techniques, the big advantage of dynamic symmetry breaking is that it can accommodat...
Daniel S. Heller, Meinolf Sellmann