Sciweavers

406 search results - page 12 / 82
» Boosting Using Branching Programs
Sort
View
ISCA
1998
IEEE
137views Hardware» more  ISCA 1998»
13 years 11 months ago
Accurate Indirect Branch Prediction
Indirect branch prediction is likely to become increasingly important in the future because indirect branches occur more frequently in object-oriented programs. With misprediction ...
Karel Driesen, Urs Hölzle
ICPR
2000
IEEE
13 years 11 months ago
Scaling-Up Support Vector Machines Using Boosting Algorithm
In the recent years support vector machines (SVMs) have been successfully applied to solve a large number of classification problems. Training an SVM, usually posed as a quadrati...
Dmitry Pavlov, Jianchang Mao, Byron Dom
CORR
2006
Springer
160views Education» more  CORR 2006»
13 years 7 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
MICRO
2003
IEEE
155views Hardware» more  MICRO 2003»
14 years 20 days ago
Comparing Program Phase Detection Techniques
Detecting program phase changes accurately is an important aspect of dynamically adaptable systems. Three dynamic program phase detection techniques are compared – using instruc...
Ashutosh S. Dhodapkar, James E. Smith
CC
2005
Springer
124views System Software» more  CC 2005»
14 years 28 days ago
Boosting the Performance of Multimedia Applications Using SIMD Instructions
Modern processors’ multimedia extensions (MME) provide SIMD ISAs to boost the performance of typical operations in multimedia applications. However, automatic vectorization suppo...
Weihua Jiang, Chao Mei, Bo Huang, Jianhui Li, Jiah...