Sciweavers

406 search results - page 14 / 82
» Boosting Using Branching Programs
Sort
View
ICML
2010
IEEE
13 years 8 months ago
Boosting Classifiers with Tightened L0-Relaxation Penalties
We propose a novel boosting algorithm which improves on current algorithms for weighted voting classification by striking a better balance between classification accuracy and the ...
Noam Goldberg, Jonathan Eckstein
CORR
2006
Springer
109views Education» more  CORR 2006»
13 years 7 months ago
On Conditional Branches in Optimal Decision Trees
The decision tree is one of the most fundamental ing abstractions. A commonly used type of decision tree is the alphabetic binary tree, which uses (without loss of generality) &quo...
Michael B. Baer
CGO
2007
IEEE
14 years 1 months ago
Evaluating Indirect Branch Handling Mechanisms in Software Dynamic Translation Systems
Software Dynamic Translation (SDT) systems are used for program instrumentation, dynamic optimization, security, intrusion detection, and many other uses. As noted by many researc...
Jason Hiser, Daniel Williams, Wei Hu, Jack W. Davi...
EUROPAR
2001
Springer
13 years 12 months ago
An Efficient Indirect Branch Predictor
In this paper, we present a new hybrid branch predictor called the GoStay2, which can effectively reduce indirect misprediction rates. The GoStay2 has two different mechanisms comp...
Yul Chu, Mabo Robert Ito
IH
2005
Springer
14 years 27 days ago
Self-validating Branch-Based Software Watermarking
Software protection is an area of active research in which a variety of techniques have been developed to address the issue. Examples of such techniques are software watermarking, ...
Ginger Myles, Hongxia Jin