4908 search results - page 48 / 982 » On the Complexity of Optimal K-Anonymity |
206
click to vote
FGR
2011
IEEE
14 years 9 months ago
2011
IEEE
— In this work, we present novel warping algorithms for full 2D pixel-grid deformations for face recognition. Due to high variation in face appearance, face recognition is consid...
257
click to vote
ICDCS
2012
IEEE
13 years 8 months ago
2012
IEEE
—Cloud resources are usually priced in multiple markets with different service guarantees. For example, Amazon EC2 prices virtual instances under three pricing schemes — the su...
159
click to vote
WDAG
2007
Springer
16 years 7 days ago
2007
Springer
Many recommend planning for the worst and hoping for the best. In this paper we devise efficient indulgent consensus algorithms that can tolerate crash failures and arbitrarily lo...
158
click to vote
ATAL
2004
Springer
15 years 11 months ago
2004
Springer
We study the complexity of a multilateral negotiation framework where autonomous agents agree on a sequence of deals to exchange sets of discrete resources in order to both furthe...
140
click to vote
ICALP
2005
Springer
15 years 11 months ago
2005
Springer
We consider the problem of testing the commutativity of a black-box group specified by its k generators. The complexity (in terms of k) of this problem was first considered by Pa...