4908 search results - page 47 / 982 » On the Complexity of Optimal K-Anonymity |
172
click to vote
JMLR
2012
13 years 8 months ago
2012
We present SpeedBoost, a natural extension of functional gradient descent, for learning anytime predictors, which automatically trade computation time for predictive accuracy by s...
183
click to vote
ICASSP
2011
IEEE
14 years 9 months ago
2011
IEEE
The maximization of a positive (semi)definite complex quadratic form over a finite alphabet is NP-hard and achieved through exhaustive search when the form has full rank. Howeve...
180
click to vote
ICASSP
2011
IEEE
14 years 9 months ago
2011
IEEE
The goal of this paper consists in characterizing the capacity region of a broadcast system based on analog antenna combining and orthogonal frequency division multiplexing (OFDM)...
167
click to vote
ACMICEC
2003
ACM
15 years 11 months ago
2003
ACM
The aggregation of conflicting preferences is a central problem in multiagent systems. The key difficulty is that the agents may report their preferences insincerely. Mechanism ...
202
click to vote
CGF
2011
14 years 9 months ago
2011
We introduce a fully automatic algorithm which optimizes the high-level structure of a given quadrilateral mesh to achieve a coarser quadrangular base complex. Such a topological ...