1464 search results - page 85 / 293 » On optimal anonymization for l -diversity |
190
click to vote
PLDI
1995
ACM
15 years 10 months ago
1995
ACM
Traditional list schedulers order instructions based on an optimistic estimate of the load latency imposed by the hardware and therefore cannot respond to variations in memory lat...
165
click to vote
CPAIOR
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Replication is a fundamental technique for increasing throughput and achieving fault tolerance in distributed data services. However, its implementation may induce signif...
186
click to vote
ACL
1998
15 years 7 months ago
1998
This paper describes a novel method by which a dialogue agent can learn to choose an optimal dialogue strategy. While it is widely agreed that dialogue strategies should be formul...
160
click to vote
AIPS
2009
15 years 7 months ago
2009
We provide a theoretical analysis of planning via Petri net unfolding, a novel technique for synthesising parallel plans. Parallel plans are generally valued for their execution f...
142
click to vote
SIAMIS
2008
15 years 6 months ago
2008
This paper introduces a new approach to the problem of quantitative reconstruction of an object from few radiographic views. A mixed variable programming problem is formulated in ...