نتایج جستجو برای: data selector
تعداد نتایج: 2411604 فیلتر نتایج به سال:
An automatic selection method for an integrated multiple MT system is proposed. This method employs a machine learning approach to build an automatic MT selector. The selector learns based on the parameters of MT systems and the evaluation result provided by a human evaluator. An experiment is conducted on two MT systems developed in our laboratories. Experimental results show the effectiveness...
Alzheimer’s disease is a degenerative that affects the progression of age and causes brain to be unable fulfill its expected functions. Depending on stage, effects (AD) vary from forgetting names surrounding people not being able continue daily life without assistance. To best our knowledge, there are no generally accepted diagnostic or treatment methods. In this study, binary version ar...
GENERALIZED INSTRUCTION SELECTOR GENERATION: THE AUTOMATIC CONSTRUCTION OF INSTRUCTION SELECTORS FROM DESCRIPTIONS OF COMPILER INTERNAL FORMS AND TARGET MACHINES
Prior work has shown that context-specific independence (CSI) in Bayes networks can be exploited to speed up belief updating. We examine how networks with variables exhibiting mutual exclusion (e.g. “selector variables”), as well as CSI, can be efficiently updated. In particular, singlyconnected networks, that have an additional common selector variable, can be updated in linear time, where qua...
An 8ch, 400 GHz monolithically integrated WDM channel selector featuring an array of quantum well semiconductor optical amplifiers (SOA) and arrayed waveguidegrating demultiplexer is presented. Reduction of fabrication complexity was achieved by using a single step selective area MOVPE to realize the different bandgap profiles for the SOA array and passive region. The selective growth mask dime...
5 The LASSO 9 5.1 Performance of Lasso estimates . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 5.2 “Normal equations” for the LASSO solutions. . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 5.3 Facts about Lasso solutions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 This short document presents the Dantzig Selector, first introd...
The importance and the difficulty of the folding problem have led scientists to develop several computational methods for protein structure prediction. Despite the abundance of protein structure prediction methods, these approaches have two major limitations. First, the top ranked model reported by a server is not necessarily the best predicted model. The correct predicted model may be ranked w...
given just a single parameter t. Two active-set methods were described in [11], with some concern about efficiency if p were large, where X is n× p . Later when basis pursuit de-noising (BPDN) was introduced [2], the intention was to deal with p very large and to allow X to be a sparse matrix or a fast operator. A primal–dual interior method was used to solve the associated quadratic program, b...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید