Sciweavers

65 search results - page 11 / 13
» Blowing up The Power Set of The Least Measurable
Sort
View
MICRO
2009
IEEE
133views Hardware» more  MICRO 2009»
14 years 1 months ago
A tagless coherence directory
A key challenge in architecting a CMP with many cores is maintaining cache coherence in an efficient manner. Directory-based protocols avoid the bandwidth overhead of snoop-based ...
Jason Zebchuk, Vijayalakshmi Srinivasan, Moinuddin...
SODA
2010
ACM
171views Algorithms» more  SODA 2010»
14 years 4 months ago
Coresets and Sketches for High Dimensional Subspace Approximation Problems
We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each p...
Dan Feldman, Morteza Monemizadeh, Christian Sohler...
VLDB
2003
ACM
147views Database» more  VLDB 2003»
14 years 7 months ago
RE-tree: an efficient index structure for regular expressions
Due to their expressive power, Regular Expressions (REs) are quickly becoming an integral part of language specifications for several important application scenarios. Many of thes...
Chee Yong Chan, Minos N. Garofalakis, Rajeev Rasto...
ICDE
2008
IEEE
124views Database» more  ICDE 2008»
14 years 8 months ago
Mining Approximate Order Preserving Clusters in the Presence of Noise
Subspace clustering has attracted great attention due to its capability of finding salient patterns in high dimensional data. Order preserving subspace clusters have been proven to...
Mengsheng Zhang, Wei Wang 0010, Jinze Liu
ACMSE
2004
ACM
14 years 13 days ago
Performance evaluation of cache replacement policies for the SPEC CPU2000 benchmark suite
Replacement policy, one of the key factors determining the effectiveness of a cache, becomes even more important with latest technological trends toward highly associative caches....
Hussein Al-Zoubi, Aleksandar Milenkovic, Milena Mi...