4908 search results - page 270 / 982 » On the Complexity of Optimal K-Anonymity |
172
click to vote
ECCV
2006
Springer
16 years 8 months ago
2006
Springer
Abstract. Establishing correspondence between features of a set of images has been a long-standing issue amongst the computer vision community. We propose a method that solves the ...
154
click to vote
ICIP
2003
IEEE
16 years 8 months ago
2003
IEEE
In this paper we present two optimum (in a rate-distortion ? RD ? sense) rate-control algorithms for FGS scalable video. The proposed methods, which could compliment recently prop...
167
click to vote
DAC
2002
ACM
16 years 7 months ago
2002
ACM
Aim of this paper is to propose a methodology for the definition of an instruction-level energy estimation framework for VLIW (Very Long Instruction Word) processors. The power mo...
160
click to vote
STOC
2005
ACM
16 years 7 months ago
2005
ACM
We give a 1-pass ~O(m1-2/k )-space algorithm for computing the k-th frequency moment of a data stream for any real k > 2. Together with the lower bounds of [1, 2, 4], this reso...
183
click to vote
ICDE
2010
IEEE
16 years 3 months ago
2010
IEEE
— Many applications require sorting a table over multiple sort orders: generation of multiple reports from a table, evaluation of a complex query that involves multiple instances...