4908 search results - page 960 / 982 » On the Complexity of Optimal K-Anonymity |
SODA
1992
ACM
15 years 27 days ago
1992
ACM
Given a family of disjoint polygons P1, P2, : : :, Pk in the plane, and an integer parameter m, it is NP-complete to decide if the Pi's can be pairwise separated by a polygon...
ATAL
2010
Springer
15 years 26 days ago
2010
Springer
Experimental analysis of networks of cooperative learning agents (to verify certain properties such as the system's stability) has been commonly used due to the complexity of...
122
click to vote
AAMAS
2010
Springer
14 years 12 months ago
2010
Springer
Abstract The advent of large-scale distributed systems poses unique engineering challenges. In open systems such as the internet it is not possible to prescribe the behaviour of al...
140
Voted
ADHOC
2010
14 years 12 months ago
2010
Intelligent Transportation Systems (ITS) are a hot topic in the communications society. Currently, research is primarily focusing on setting up Vehicular Ad Hoc Networks (VANETs) ...
112
click to vote
BIODATAMINING
2008
14 years 12 months ago
2008
This editorial introduces BioData Mining, a new journal which publishes research articles related to advances in computational methods and techniques for the extraction of useful ...