Sciweavers

232 search results - page 9 / 47
» On Characterizing the Data Access Complexity of Programs
Sort
View
ICALP
2004
Springer
15 years 4 months ago
The Black-Box Complexity of Nearest Neighbor Search
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
Robert Krauthgamer, James R. Lee
MICRO
1999
IEEE
98views Hardware» more  MICRO 1999»
15 years 2 months ago
Access Region Locality for High-Bandwidth Processor Memory System Design
This paper studies an interesting yet less explored behavior of memory access instructions, called access region locality. Unlike the traditional temporal and spatial data localit...
Sangyeun Cho, Pen-Chung Yew, Gyungho Lee
BMCBI
2010
98views more  BMCBI 2010»
14 years 10 months ago
miRMaid: a unified programming interface for microRNA data resources
Background: MicroRNAs (miRNAs) are endogenous small RNAs that play a key role in post-transcriptional regulation of gene expression in animals and plants. The number of known miRN...
Anders Jacobsen, Anders Krogh, Sakari Kauppinen, M...
MICRO
2009
IEEE
168views Hardware» more  MICRO 2009»
15 years 5 months ago
Ordering decoupled metadata accesses in multiprocessors
Hardware support for dynamic analysis can minimize the performance overhead of useful applications such as security checks, debugging, and profiling. To eliminate implementation ...
Hari Kannan
POPL
2007
ACM
15 years 11 months ago
Locality approximation using time
Reuse distance (i.e. LRU stack distance) precisely characterizes program locality and has been a basic tool for memory system research since the 1970s. However, the high cost of m...
Xipeng Shen, Jonathan Shaw, Brian Meeker, Chen Din...