Sciweavers

4889 search results - page 978 / 978
» A Refactoring Approach to Parallelism
Sort
View
ICS
2009
Tsinghua U.
13 years 11 months ago
Less reused filter: improving l2 cache performance via filtering less reused lines
The L2 cache is commonly managed using LRU policy. For workloads that have a working set larger than L2 cache, LRU behaves poorly, resulting in a great number of less reused lines...
Lingxiang Xiang, Tianzhou Chen, Qingsong Shi, Wei ...
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
13 years 10 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
IJCAI
1989
13 years 5 months ago
A Theorem Prover for Prioritized Circumscription
In a recent paper, Ginsberg shows how a backward-chaining ATMS can be used to construct a theorem prover for circumscription. Here, this work is extended to handle prioritized cir...
Andrew B. Baker, Matthew L. Ginsberg
BMCBI
2010
160views more  BMCBI 2010»
13 years 4 months ago
Annotation of gene promoters by integrative data-mining of ChIP-seq Pol-II enrichment data
Background: Use of alternative gene promoters that drive widespread cell-type, tissue-type or developmental gene regulation in mammalian genomes is a common phenomenon. Chromatin ...
Ravi Gupta, Priyankara Wikramasinghe, Anirban Bhat...