Sciweavers

57 search results - page 8 / 12
» Data Memory Subsystem Resilient to Process Variations
Sort
View
DEXA
2003
Springer
135views Database» more  DEXA 2003»
14 years 23 days ago
On the Optimality of Holistic Algorithms for Twig Queries
Streaming XML documents has many emerging applications. However, in this paper, we show that the restrictions imposed by data streaming are too restrictive for processing twig quer...
Byron Choi, Malika Mahoui, Derick Wood
CASES
2009
ACM
13 years 11 months ago
A fault tolerant cache architecture for sub 500mV operation: resizable data composer cache (RDC-cache)
In this paper we introduce Resizable Data Composer-Cache (RDC-Cache). This novel cache architecture operates correctly at sub 500 mV in 65 nm technology tolerating large number of...
Avesta Sasan, Houman Homayoun, Ahmed M. Eltawil, F...
ISCA
1998
IEEE
135views Hardware» more  ISCA 1998»
13 years 11 months ago
Branch Prediction Based on Universal Data Compression Algorithms
Data compression and prediction are closely related. Thus prediction methods based on data compression algorithms have been suggested for the branch prediction problem. In this wo...
Eitan Federovsky, Meir Feder, Shlomo Weiss
CVPR
2008
IEEE
14 years 9 months ago
Incremental learning of nonparametric Bayesian mixture models
Clustering is a fundamental task in many vision applications. To date, most clustering algorithms work in a batch setting and training examples must be gathered in a large group b...
Ryan Gomes, Max Welling, Pietro Perona
VLDB
2010
ACM
144views Database» more  VLDB 2010»
13 years 5 months ago
Methods for finding frequent items in data streams
The frequent items problem is to process a stream of items and find all items occurring more than a given fraction of the time. It is one of the most heavily studied problems in d...
Graham Cormode, Marios Hadjieleftheriou