Sciweavers

1594 search results - page 51 / 319
» Fast Prediction on a Tree
Sort
View
DDECS
2008
IEEE
185views Hardware» more  DDECS 2008»
14 years 2 months ago
Fast Boolean Minimizer for Completely Specified Functions
: We propose a simple and fast two-level minimization algorithm for completely specified functions in this paper. The algorithm is based on processing ternary trees. A ternary tree...
Petr Fiser, Pemysl Rucký, Irena Vanov&aacut...
INFOCOM
2005
IEEE
14 years 1 months ago
Fast replication in content distribution overlays
— We present SPIDER – a system for fast replication or distribution of large content from a single source to multiple sites interconnected over Internet or via a private networ...
Samrat Ganguly, Akhilesh Saxena, Sudeept Bhatnagar...
PVLDB
2010
136views more  PVLDB 2010»
13 years 6 months ago
SigMatch: Fast and Scalable Multi-Pattern Matching
Multi-pattern matching involves matching a data item against a large database of “signature” patterns. Existing algorithms for multipattern matching do not scale well as the s...
Ramakrishnan Kandhan, Nikhil Teletia, Jignesh M. P...
HPCA
1998
IEEE
14 years 7 days ago
Supporting Highly-Speculative Execution via Adaptive Branch Trees
Most of the prediction mechanisms predict a single path to continue the execution on a branch. Alternatively, we may exploit parallelism from either possible paths of a branch, di...
Tien-Fu Chen
CORR
2006
Springer
160views Education» more  CORR 2006»
13 years 8 months ago
On Conditional Branches in Optimal Search Trees
A commonly used type of search tree is the alphabetic binary tree, which uses (without loss of generality) "less than" versus "greater than or equal to" tests ...
Michael B. Baer