Sciweavers

2913 search results - page 43 / 583
» How Much to Copy
Sort
View
WDAG
1995
Springer
100views Algorithms» more  WDAG 1995»
13 years 11 months ago
Universal Constructions for Large Objects
We present lock-free and wait-free universal constructions for implementing large shared objects. Most previous universal constructions require processes to copy the entire object...
James H. Anderson, Mark Moir
KDD
2008
ACM
163views Data Mining» more  KDD 2008»
14 years 8 months ago
The cost of privacy: destruction of data-mining utility in anonymized data publishing
Re-identification is a major privacy threat to public datasets containing individual records. Many privacy protection algorithms rely on generalization and suppression of "qu...
Justin Brickell, Vitaly Shmatikov
STOC
2007
ACM
100views Algorithms» more  STOC 2007»
14 years 8 months ago
Reordering buffers for general metric spaces
In the reordering buffer problem, we are given an input sequence of requests for service each of which corresponds to a point in a metric space. The cost of serving the requests h...
Matthias Englert, Harald Räcke, Matthias West...
SIGCSE
2009
ACM
143views Education» more  SIGCSE 2009»
14 years 2 months ago
Thinking about computational thinking
Jeannette Wing’s call for teaching Computational Thinking (CT) as a formative skill on par with reading, writing, and arithmetic places computer science in the category of basic...
James J. Lu, George H. L. Fletcher
VEE
2006
ACM
150views Virtualization» more  VEE 2006»
14 years 1 months ago
Evaluating fragment construction policies for SDT systems
Software Dynamic Translation (SDT) systems have been used for program instrumentation, dynamic optimization, security policy enforcement, intrusion detection, and many other uses....
Jason Hiser, Daniel Williams, Adrian Filipi, Jack ...