4908 search results - page 929 / 982 » On the Complexity of Optimal K-Anonymity |
MICRO
2007
IEEE
15 years 6 months ago
2007
IEEE
Single-threaded programming is already considered a complicated task. The move to multi-threaded programming only increases the complexity and cost involved in software developmen...
CIKM
2007
Springer
15 years 6 months ago
2007
Springer
Visualizing network data, from tree structures to arbitrarily connected graphs, is a difficult problem in information visualization. A large part of the problem is that in network...
CIKM
2007
Springer
15 years 6 months ago
2007
Springer
Queries issued by casual users or specialists exploring a data set often point us to important subsets of the data, be it clusters, outliers or other features of particular import...
101
click to vote
CP
2007
Springer
15 years 6 months ago
2007
Springer
Searching for optimal solutions to a problem using lower bounds obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however, explicit rel...
ESA
2007
Springer
15 years 6 months ago
2007
Springer
We review recent progress in the study of arrangements in computational and combinatorial geometry, and discuss several open problems and areas for further research. In this talk I...