نتایج جستجو برای: piece wise linearization
تعداد نتایج: 54466 فیلتر نتایج به سال:
-In this paper, the microstatistic multi-user detection receiver (MSF-MUD) will be introduced. The output of the MSF-MUD is taken as the sign of the multi-channel non-linear transformation of the output of a bank of matched filters (BMF). In the case of the MSF-MUD, this transformation is done by multi-channel conventional microstatistic filter (MCMF). Because the M-CMF theory has not been avai...
Shortening of design cycles is currently obtained by designing digital systems at gate or cell level, using precharacterized gate or cell delays to speed up the performance analysis. Modeling timing library format is one of the most difficult task of library designers. We present in this paper a piece wise linear approximation of the delay performance equations of submicronic CMOS library, cons...
Proefschrift ter verkrijging van de graad van Doctor aan de Universiteit Leiden, op gezag van de Rector Magnificus Dr. Van dit proefschrift is ook een handelseditie verschenen
Gradient boosting using decision trees as base learners, so called Gradient Boosted Decision Trees (GBDT), is a very successful ensemble learning algorithm widely used across a variety of applications. Recently, various GDBT construction algorithms and implementation have been designed and heavily optimized in some very popular open sourced toolkits such as XGBoost and LightGBM. In this paper, ...
We describe an algorithm for obtaining correspondences across a group of images of deformable objects. The approach is to construct a statistical model of appearance which can encode the training images as compactly as possible (a Minimum Description Length framework). Correspondences are defined by piece-wise linear interpolation between a set of control points defined on each image. Given suc...
We propose a new method, binary fused compressive sensing (BFCS), to recover sparse piece-wise smooth signals from 1-bit compressive measurements. The proposed algorithm is a modification of the previous binary iterative hard thresholding (BIHT) algorithm, where, in addition to the sparsity constraint, the total-variation of the recovered signal is upper constrained. As in BIHT, the data term o...
This work presents a methodology to derive explicit control laws for hybrid linear systems. The proposed method employs multi-parametric and dynamic programming techniques to dissemble the original MPC formulation into a set of smaller problems, which can be efficiently solved using suitable multi-parametric mixed integer programming algorithms. The solution comprises the envelope of explicit p...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید