Sciweavers

246 search results - page 20 / 50
» Tantra: A Fast PRNG Algorithm and its Implementation
Sort
View
INFOCOM
2012
IEEE
11 years 11 months ago
The Variable-Increment Counting Bloom Filter
—Counting Bloom Filters (CBFs) are widely used in networking device algorithms. They implement fast set representations to support membership queries with limited error, and supp...
Ori Rottenstreich, Yossi Kanizo, Isaac Keslassy
ISPD
2006
ACM
90views Hardware» more  ISPD 2006»
14 years 2 months ago
Fast buffer insertion considering process variations
Advanced process technologies call for a proactive consideration of process variations in design to ensure high parametric timing yield. Despite of its popular use in almost any h...
Jinjun Xiong, Lei He
COCOON
2005
Springer
14 years 2 months ago
RIATA-HGT: A Fast and Accurate Heuristic for Reconstructing Horizontal Gene Transfer
Horizontal gene transfer (HGT) plays a major role in microbial genome diversification, and is claimed to be rampant among various groups of genes in bacteria. Further, HGT is a ma...
Luay Nakhleh, Derek A. Ruths, Li-San Wang
ISPASS
2009
IEEE
14 years 3 months ago
WARP: Enabling fast CPU scheduler development and evaluation
Abstract—Developing CPU scheduling algorithms and understanding their impact in practice can be difficult and time consuming due to the need to modify and test operating system ...
Haoqiang Zheng, Jason Nieh
CGO
2009
IEEE
14 years 3 months ago
Fast Track: A Software System for Speculative Program Optimization
—Fast track is a software speculation system that enables unsafe optimization of sequential code. It speculatively runs optimized code to improve performance and then checks the ...
Kirk Kelsey, Tongxin Bai, Chen Ding, Chengliang Zh...