4908 search results - page 51 / 982 » On the Complexity of Optimal K-Anonymity |
164
click to vote
ICDCN
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. We re-visit the problem of perfectly secure message transmission (PSMT) in a directed network under the presence of a threshold adaptive Byzantine adversary, having unbou...
160
click to vote
CAD
2000
Springer
15 years 6 months ago
2000
Springer
Very large and geometrically complex scenes, exceeding millions of polygons and hundreds of objects, arise naturally in many areas of interactive computer graphics. Time-critical ...
281
click to vote
ICAART
2010
INSTICC
16 years 3 months ago
2010
INSTICC
There has been a lot of recent work on Bayesian methods for reinforcement learning exhibiting near-optimal online performance. The main obstacle facing such methods is that in most...
156
click to vote
INFOCOM
2007
IEEE
16 years 13 days ago
2007
IEEE
— We introduce a low-complexity distributed slotted MAC protocol that can support all feasible arrival rates in a wireless backhaul network (WBN). For arbitrary wireless networks...
176
click to vote
CODES
2006
IEEE
16 years 5 days ago
2006
IEEE
Embedded system optimization typically considers objectives such as cost, timing, buffer sizes and power consumption. Robustness criteria, i.e. sensitivity of the system to variat...