4908 search results - page 92 / 982 » On the Complexity of Optimal K-Anonymity |
158
click to vote
EDUTAINMENT
2006
Springer
15 years 10 months ago
2006
Springer
In this paper, we present a novel method for dynamic terrain in battlefield and an efficient plan to simulate crater in the battle. We explore a few methods for dynamic terrain sur...
153
click to vote
AAAI
2008
15 years 8 months ago
2008
Automated generators for synthetic models and data can play a crucial role in designing new algorithms/modelframeworks, given the sparsity of benchmark models for empirical analys...
160
click to vote
DAM
2006
15 years 6 months ago
2006
The maximum intersection problem for a matroid and a greedoid, given by polynomialtime oracles, is shown NP-hard by expressing the satisfiability of boolean formulas in 3-conjunct...
154
click to vote
PR
2002
15 years 6 months ago
2002
Text extraction in mixed-type documents is a pre-processing and necessary stage for many document applications. In mixed-type color documents, text, drawings and graphics appear w...
178
click to vote
SIAMJO
2010
15 years 4 months ago
2010
The imposition of general disjunctions of the form “πx ≤ π0 ∨ πx ≥ π0 + 1”, where π, π0 are integer valued, is a fundamental operation in both the branch-and-bound...