Sciweavers

539 search results - page 44 / 108
» Recurrence relations and fast algorithms
Sort
View
100
Voted
CODES
2008
IEEE
15 years 7 months ago
Static analysis for fast and accurate design space exploration of caches
Application-specific system-on-chip platforms create the opportunity to customize the cache configuration for optimal performance with minimal chip estate. Simulation, in partic...
Yun Liang, Tulika Mitra
96
Voted
BMCBI
2010
86views more  BMCBI 2010»
15 years 17 days ago
Fast motif recognition via application of statistical thresholds
Background: Improving the accuracy and efficiency of motif recognition is an important computational challenge that has application to detecting transcription factor binding sites...
Christina Boucher, James King
121
Voted
HIPC
2009
Springer
14 years 10 months ago
Fast checkpointing by Write Aggregation with Dynamic Buffer and Interleaving on multicore architecture
Large scale compute clusters continue to grow to ever-increasing proportions. However, as clusters and applications continue to grow, the Mean Time Between Failures (MTBF) has redu...
Xiangyong Ouyang, Karthik Gopalakrishnan, Tejus Ga...
94
Voted
ALENEX
2007
127views Algorithms» more  ALENEX 2007»
15 years 1 months ago
Intersection in Integer Inverted Indices
Inverted index data structures are the key to fast search engines. The predominant operation on inverted indices asks for intersecting two sorted lists of document IDs which might...
Peter Sanders, Frederik Transier
103
Voted
SC
2009
ACM
15 years 5 months ago
A framework for core-level modeling and design of reconfigurable computing algorithms
Reconfigurable computing (RC) is rapidly becoming a vital technology for many applications, from high-performance computing to embedded systems. The inherent advantages of custom-...
Gongyu Wang, Greg Stitt, Herman Lam, Alan D. Georg...