Sciweavers

2131 search results - page 228 / 427
» Immunity for Closed Sets
Sort
View
ISCA
2007
IEEE
177views Hardware» more  ISCA 2007»
16 years 27 days ago
Adaptive insertion policies for high performance caching
The commonly used LRU replacement policy is susceptible to thrashing for memory-intensive workloads that have a working set greater than the available cache size. For such applica...
Moinuddin K. Qureshi, Aamer Jaleel, Yale N. Patt, ...
IAT
2006
IEEE
16 years 20 days ago
Trust Negotiations with Customizable Anonymity
Trust negotiation makes it possible for two parties to carry on secure transactions by first establishing trust through a bilateral, iterative process of requesting and disclosin...
Anna Cinzia Squicciarini, Abhilasha Bhargav-Spantz...
SC
2005
ACM
16 years 5 days ago
Bridging the Macro and Micro: A Computing Intensive Earthquake Study Using Discovery Net
We present the development and use of a novel distributed geohazard modeling environment for the analysis and interpretation of large scale earthquake data sets. Our work demonstr...
Yike Guo, Jian Guo Liu, Moustafa Ghanem, Kyran Mis...
COCO
2003
Springer
82views Algorithms» more  COCO 2003»
15 years 12 months ago
Derandomization and Distinguishing Complexity
We continue an investigation of resource-bounded Kolmogorov complexity and derandomization techniques begun in [2, 3]. We introduce nondeterministic time-bounded Kolmogorov comple...
Eric Allender, Michal Koucký, Detlef Ronneb...
168
Voted
COCOON
2010
Springer
15 years 11 months ago
Clustering with or without the Approximation
We study algorithms for clustering data that were recently proposed by Balcan, Blum and Gupta in SODA’09 [4] and that have already given rise to two follow-up papers. The input f...
Frans Schalekamp, Michael Yu, Anke van Zuylen