Sciweavers

25 search results - page 3 / 5
» Partial Value Number Redundancy Elimination
Sort
View
MICRO
1999
IEEE
109views Hardware» more  MICRO 1999»
13 years 10 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
CGO
2005
IEEE
13 years 11 months ago
Model-Based Framework: An Approach for Profit-Driven Optimization
Although optimizations have been applied for a number of years to improve the performance of software, problems that have been long-standing remain, which include knowing what opt...
Min Zhao, Bruce R. Childers, Mary Lou Soffa
POS
1998
Springer
13 years 10 months ago
Optimizing the Read and Write Barriers for Orthogonal Persistence
Persistent programming languages manage volatile memory as a cache for stable storage, imposing a read barrier on operations that access the cache, and a write barrier on updates ...
Antony L. Hosking, Nathaniel Nystrom, Quintin I. C...
EWCBR
2006
Springer
13 years 9 months ago
Fast Case Retrieval Nets for Textual Data
Case Retrieval Networks (CRNs) facilitate flexible and efficient retrieval in Case-Based Reasoning (CBR) systems. While CRNs scale up well to handle large numbers of cases in the c...
Sutanu Chakraborti, Robert Lothian, Nirmalie Wirat...
IJFCS
2008
102views more  IJFCS 2008»
13 years 5 months ago
Succinct Minimal Generators: Theoretical Foundations and Applications
In data mining applications, highly sized contexts are handled what usually results in a considerably large set of frequent itemsets, even for high values of the minimum support t...
Tarek Hamrouni, Sadok Ben Yahia, Engelbert Mephu N...