Sciweavers

180 search results - page 31 / 36
» Static Caching for Incremental Computation
Sort
View
ICDM
2003
IEEE
140views Data Mining» more  ICDM 2003»
14 years 19 days ago
Mining Frequent Itemsets in Distributed and Dynamic Databases
Traditional methods for frequent itemset mining typically assume that data is centralized and static. Such methods impose excessive communication overhead when data is distributed...
Matthew Eric Otey, Chao Wang, Srinivasan Parthasar...
CIKM
2006
Springer
13 years 11 months ago
The visual funding navigator: analysis of the NSF funding information
This paper presents an interactive visualization toolkit for navigating and analyzing the National Science Foundation (NSF) funding information. Our design builds upon an improved...
Shixia Liu, Nan Cao, Hao Lv, Hui Su
ECRTS
2007
IEEE
14 years 1 months ago
WCET-Directed Dynamic Scratchpad Memory Allocation of Data
Many embedded systems feature processors coupled with a small and fast scratchpad memory. To the difference with caches, allocation of data to scratchpad memory must be handled by...
Jean-François Deverge, Isabelle Puaut
HIPEAC
2007
Springer
14 years 1 months ago
Branch History Matching: Branch Predictor Warmup for Sampled Simulation
Computer architects and designers rely heavily on simulation. The downside of simulation is that it is very time-consuming — simulating an industry-standard benchmark on todayâ€...
Simon Kluyskens, Lieven Eeckhout
IEEEPACT
2000
IEEE
13 years 11 months ago
The Effect of Code Reordering on Branch Prediction
Branch prediction accuracy is a very important factor for superscalarprocessor performance. The ability topredict the outcome of a branch allows the processor to effectively use a...
Alex Ramírez, Josep-Lluis Larriba-Pey, Mate...