Sciweavers

1768 search results - page 3 / 354
» Estimating types in binaries using predictive modeling
Sort
View
EWCBR
2008
Springer
13 years 7 months ago
Instance-Based Label Ranking using the Mallows Model
In this paper, we introduce a new instance-based approach to the label ranking problem. This approach is based on a probability model on rankings which is known as the Mallows mode...
Weiwei Cheng, Eyke Hüllermeier
CSDA
2006
145views more  CSDA 2006»
13 years 5 months ago
Improved predictions penalizing both slope and curvature in additive models
A new method is proposed to estimate the nonlinear functions in an additive regression model. Usually, these functions are estimated by penalized least squares, penalizing the cur...
Magne Aldrin
ISPDC
2008
IEEE
13 years 11 months ago
Load Balancing in Mesh-like Computations using Prediction Binary Trees
We present a load-balancing technique that exploits the temporal coherence, among successive computation phases, in mesh-like computations to be mapped on a cluster of processors....
Biagio Cosenza, Gennaro Cordasco, Rosario De Chiar...
ICB
2009
Springer
188views Biometrics» more  ICB 2009»
13 years 12 months ago
Pixelwise Local Binary Pattern Models of Faces Using Kernel Density Estimation
Local Binary Pattern (LBP) histograms have attained much attention in face image analysis. They have been successfully used in face detection, recognition, verification, facial ex...
Timo Ahonen, Matti Pietikäinen
CORR
2006
Springer
160views Education» more  CORR 2006»
13 years 5 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