Sciweavers

4850 search results - page 845 / 970
» Approximate Data Structures with Applications
Sort
View
IEEEPACT
2006
IEEE
15 years 4 months ago
Overlapping dependent loads with addressless preload
Modern out-of-order processors with non-blocking caches exploit Memory-Level Parallelism (MLP) by overlapping cache misses in a wide instruction window. The exploitation of MLP, h...
Zhen Yang, Xudong Shi, Feiqi Su, Jih-Kwon Peir
KDD
2009
ACM
230views Data Mining» more  KDD 2009»
15 years 2 months ago
Grouped graphical Granger modeling methods for temporal causal modeling
We develop and evaluate an approach to causal modeling based on time series data, collectively referred to as“grouped graphical Granger modeling methods.” Graphical Granger mo...
Aurelie C. Lozano, Naoki Abe, Yan Liu, Saharon Ros...
CASES
2007
ACM
15 years 2 months ago
Eliminating inter-process cache interference through cache reconfigurability for real-time and low-power embedded multi-tasking
We propose a technique which leverages configurable data caches to address the problem of cache interference in multitasking embedded systems. Data caches are often necessary to p...
Rakesh Reddy, Peter Petrov
EDBT
2009
ACM
126views Database» more  EDBT 2009»
15 years 1 months ago
A tool for mapping discovery over revealing schemas
In a world of wide-scale information sharing, the decentralized coordination has to consolidate a variety of heterogeneity. Shared data are described in different formats, i.e. da...
Verena Kantere, Dimos Bousounis, Timos K. Sellis
CIDR
2003
164views Algorithms» more  CIDR 2003»
14 years 11 months ago
Capacity Bound-free Web Warehouse
Web cache technologies have been developed as an extension of CPU cache, by modifying LRU (Least Recently Used) algorithms. Actually in web cache systems, we can use disks and ter...
Yahiko Kambayashi, Kai Cheng