Sciweavers

877 search results - page 87 / 176
» Structural Cut Elimination
Sort
View
ICDM
2008
IEEE
95views Data Mining» more  ICDM 2008»
14 years 2 months ago
Publishing Sensitive Transactions for Itemset Utility
We consider the problem of publishing sensitive transaction data with privacy preservation. High dimensionality of transaction data poses unique challenges on data privacy and dat...
Yabo Xu, Benjamin C. M. Fung, Ke Wang, Ada Wai-Che...
SCAM
2008
IEEE
14 years 2 months ago
Automatic Determination of May/Must Set Usage in Data-Flow Analysis
Data-flow analysis is a common technique to gather program information for use in transformations such as register allocation, dead-code elimination, common subexpression elimina...
Andrew Stone, Michelle Strout, Shweta Behere
ACCV
2006
Springer
14 years 1 months ago
Dense 3D Reconstruction with an Uncalibrated Active Stereo System
In this paper, we describe a novel uncalibrated active stereo system using coded structured light. Structured-light-based active stereo systems generally consist of a camera and pr...
Hiroshi Kawasaki, Yutaka Ohsawa, Ryo Furukawa, Yas...
LCPC
2005
Springer
14 years 1 months ago
Revisiting Graph Coloring Register Allocation: A Study of the Chaitin-Briggs and Callahan-Koblenz Algorithms
Techniques for global register allocation via graph coloring have been extensively studied and widely implemented in compiler frameworks. This paper examines a particular variant â...
Keith D. Cooper, Anshuman Dasgupta, Jason Eckhardt
ISLPED
2003
ACM
91views Hardware» more  ISLPED 2003»
14 years 1 months ago
Reducing reorder buffer complexity through selective operand caching
Modern superscalar processors implement precise interrupts by using the Reorder Buffer (ROB). In some microarchitectures , such as the Intel P6, the ROB also serves as a repositor...
Gurhan Kucuk, Dmitry Ponomarev, Oguz Ergin, Kanad ...