4908 search results - page 850 / 982 » On the Complexity of Optimal K-Anonymity |
172
click to vote
SAMOS
2010
Springer
15 years 4 months ago
2010
Springer
Abstract—Geometric Algebra (GA), a generalization of quaternions, is a very powerful form for intuitively expressing and manipulating complex geometric relationships common to en...
180
click to vote
SPIRE
2010
Springer
15 years 4 months ago
2010
Springer
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
170
click to vote
SSIRI
2010
15 years 4 months ago
2010
— Model-based approaches, especially based on directed graphs (DG), are becoming popular for mutation testing as they enable definition of simple, nevertheless powerful, mutation...
158
click to vote
TALG
2010
15 years 4 months ago
2010
We present two new algorithms for finding optimal strategies for discounted, infinite-horizon, Deterministic Markov Decision Processes (DMDP). The first one is an adaptation of...
200
click to vote
TCOM
2010
15 years 4 months ago
2010
—In this paper, we consider cross-layer optimization in wireless networks with wireless broadcast advantage, focusing on the problem of distributed scheduling of broadcast links....