3897 search results - page 470 / 780 » complexity 2010 |
187
Voted
SIGECOM
2010
ACM
15 years 11 months ago
2010
ACM
It is widely believed that computing payments needed to induce truthful bidding is somehow harder than simply computing the allocation. We show that the opposite is true for singl...
149
click to vote
ICFP
2010
ACM
15 years 7 months ago
2010
ACM
We want assurances that sensitive information will not be disclosed when aggregate data derived from a database is published. Differential privacy offers a strong statistical guar...
209
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
The overlap number of a finite (d + 1)-uniform hypergraph H is the largest constant c(H) (0, 1] such that no matter how we map the vertices of H into Rd , there is a point covered...
173
click to vote
CP
2010
Springer
15 years 5 months ago
2010
Springer
A recurring problem in data centres is that the constantly changing workload is not proportionally distributed over the available servers. Some resources may lay idle while others ...
236
click to vote
MEDIAFORENSICS
2010
15 years 5 months ago
2010
One of the critical steps in designing a secure biometric system is protecting the templates of the users that are stored either in a central database or on smart cards. If a biom...