4908 search results - page 134 / 982 » On the Complexity of Optimal K-Anonymity |
176
click to vote
CRYPTO
2006
Springer
15 years 10 months ago
2006
Springer
We build concurrently executable blind signatures schemes in the common reference string model, based on general complexity assumptions, and with optimal round complexity. Namely, ...
175
click to vote
ICALP
2000
Springer
15 years 10 months ago
2000
Springer
We establish that the algorithmic complexity of the minimum spanning tree problem is equal to its decision-tree complexity. Specifically, we present a deterministic algorithm to fi...
171
click to vote
ICASSP
2010
IEEE
15 years 6 months ago
2010
IEEE
The fully scalable motion model (SMM) is proposed for scalable video codec by taking advantage of motion information scalability. In previous work, SMM has been improved to suppor...
174
click to vote
TEC
2008
15 years 6 months ago
2008
Abstract--The complexity of the selection procedure of a genetic algorithm that requires reordering, if we restrict the class of the possible fitness functions to varying fitness f...
163
click to vote
CVPR
2005
IEEE
16 years 8 months ago
2005
IEEE
We propose a solution to the n-frame correspondence problem under the factorization framework. During the matching process, our algorithm takes explicitly into account the geometr...