Sciweavers

341 search results - page 39 / 69
» Redundancy elimination revisited
Sort
View
FAST
2011
13 years 10 days ago
A Study of Practical Deduplication
We collected file system content data from 857 desktop computers at Microsoft over a span of 4 weeks. We analyzed the data to determine the relative efficacy of data deduplication...
Dutch T. Meyer, William J. Bolosky
ICRA
2003
IEEE
101views Robotics» more  ICRA 2003»
14 years 2 months ago
A Branch-and-Prune Algorithm for Solving Systems of Distance Constraints
— Given a set of affine varieties in ℜ3, i.e. planes, lines, and points, the problem tackled in this paper is that of finding all possible configurations for these varieties...
Josep M. Porta, Federico Thomas, Lluís Ros,...
MICRO
1999
IEEE
109views Hardware» more  MICRO 1999»
14 years 1 months ago
Compiler-Directed Dynamic Computation Reuse: Rationale and Initial Results
Recent studies on value locality reveal that many instructions are frequently executed with a small variety of inputs. This paper proposes an approach that integrates architecture...
Daniel A. Connors, Wen-mei W. Hwu
CONSTRAINTS
1999
120views more  CONSTRAINTS 1999»
13 years 8 months ago
Refined Inequalities for Stable Marriage
We consider two approaches to the stable marriage problem: proposal algorithms and describing the stable matching polytope using linear inequalities. We illuminate the relationship...
Brian Aldershof, Olivia M. Carducci, David C. Lore...
PLDI
1990
ACM
14 years 27 days ago
A Fresh Look at Optimizing Array Bound Checking
- This paper describes techniques for optimizing range checks performed to detect array bound violations. In addition to the elimination of range check:s, the optimizations discuss...
Rajiv Gupta