4908 search results - page 360 / 982 » On the Complexity of Optimal K-Anonymity |
212
click to vote
ESWS
2007
Springer
15 years 10 months ago
2007
Springer
Many approaches to learning and teaching rely upon students working in groups. Formation of optimal groups can be a time consuming and complex task, particularly when the list of ...
166
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
The learning in a niche based learning classifier system depends both on the complexity of the problem space and on the number of available actions. In this paper, we introduce a ...
264
click to vote
COLOGNETWENTE
2010
15 years 5 months ago
2010
Bisimplicial edges in bipartite graphs are closely related to pivots in Gaussian elimination that avoid turning zeroes into non-zeroes. We present a new deterministic algorithm to...
164
click to vote
PVLDB
2010
15 years 5 months ago
2010
The ability to decompose a complex, long-running query into simpler queries that produce the same result is useful for many scenarios, such as admission control, resource manageme...
217
click to vote
GLOBECOM
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract-- We study joint rate control and resource allocation with QoS provisioning that maximizes the total utility of secondary users in cognitive radio networks. We formulate a...