4908 search results - page 324 / 982 » On the Complexity of Optimal K-Anonymity |
149
click to vote
MICRO
2008
IEEE
16 years 1 months ago
2008
IEEE
Optimizing the common case has been an adage in decades of processor design practices. However, as the system complexity and optimization techniques’ sophistication have increas...
178
click to vote
GECCO
2007
Springer
16 years 28 days ago
2007
Springer
Visualization of multidimensional data by means of Multidimensional Scaling (MDS) is a popular technique of exploratory data analysis widely usable, e.g. in analysis of bio-medica...
198
click to vote
INFOCOM
2010
IEEE
15 years 5 months ago
2010
IEEE
—Optimal scheduling for concurrent transmissions in rate-nonadaptive wireless networks is NP-hard. Optimal scheduling in rate-adaptive wireless networks is even more difficult, ...
179
click to vote
JSSPP
2010
Springer
15 years 4 months ago
2010
Springer
We present the Dynamic Priority (DP) parallel task scheduler for Hadoop. It allows users to control their allocated capacity by adjusting their spending over time. This simple mech...
181
click to vote
PPDP
2010
Springer
15 years 4 months ago
2010
Springer
Transaction Logic is a logic for representing declarative and procedural knowledge in logic programming, databases, and AI. It has been successful in areas as diverse as workflows...