394 search results - page 49 / 79 » Computing Minimal Polynomials of Matrices |
130
click to vote
CONSTRAINTS
2011
14 years 4 months ago
2011
Abstract. We consider the problem of decomposing an integer matrix into a positively weighted sum of binary matrices that have the consecutive-ones property. This problem is well-k...
108
Voted
SDM
2007
SIAM
15 years 1 months ago
2007
SIAM
Time series are difficult to monitor, summarize and predict. Segmentation organizes time series into few intervals having uniform characteristics (flatness, linearity, modality,...
IJHPCA
2006
15 years 14 days ago
2006
In this paper, we consider the communications involved in the execution of a complex application, deployed on a heterogeneous platform. Such applications extensively use macro-com...
100
Voted
EOR
2007
15 years 13 days ago
2007
In this paper, we present a stochastic version of the Location Model with Risk Pooling (LMRP) that optimizes location, inventory, and allocation decisions under random parameters ...
109
Voted
CORR
2011
Springer
14 years 4 months ago
2011
Springer
The AdaBoost algorithm was designed to combine many “weak” hypotheses that perform slightly better than random guessing into a “strong” hypothesis that has very low error....