派博傳思國(guó)際中心

標(biāo)題: Titlebook: Advances in Soft Computing; 9th Mexican Internat Grigori Sidorov,Arturo Hernández Aguirre,Carlos Al Conference proceedings 2010 Springer Be [打印本頁(yè)]

作者: ED431    時(shí)間: 2025-3-21 16:49
書(shū)目名稱Advances in Soft Computing影響因子(影響力)




書(shū)目名稱Advances in Soft Computing影響因子(影響力)學(xué)科排名




書(shū)目名稱Advances in Soft Computing網(wǎng)絡(luò)公開(kāi)度




書(shū)目名稱Advances in Soft Computing網(wǎng)絡(luò)公開(kāi)度學(xué)科排名




書(shū)目名稱Advances in Soft Computing被引頻次




書(shū)目名稱Advances in Soft Computing被引頻次學(xué)科排名




書(shū)目名稱Advances in Soft Computing年度引用




書(shū)目名稱Advances in Soft Computing年度引用學(xué)科排名




書(shū)目名稱Advances in Soft Computing讀者反饋




書(shū)目名稱Advances in Soft Computing讀者反饋學(xué)科排名





作者: 名字    時(shí)間: 2025-3-21 23:59

作者: PIZZA    時(shí)間: 2025-3-22 01:00

作者: acrophobia    時(shí)間: 2025-3-22 05:52

作者: preeclampsia    時(shí)間: 2025-3-22 10:16
Object Class Recognition Using SIFT and Bayesian Networks to translation, rotation, scale, illumination and partial occlusion. However, they have poor performance for classification tasks. In this work, SIFT features are used to solve problems of object class recognition in images using a two-step process. In its first step, the proposed method performs c
作者: aggravate    時(shí)間: 2025-3-22 14:09

作者: Expiration    時(shí)間: 2025-3-22 17:08
A Fast Fuzzy Cocke-Younger-Kasami Algorithm for DNA and RNA Strings Analysisapplied to DNA strings. We propose a variation of the original CYK algorithm where we prove that the order of the new CYK algorithm is O(.). We prove that the new algorithm only use 2.-1 memory localities. We use a variation of the CYK algorithm, where the free context language can be fuzzy. The fuz
作者: organic-matrix    時(shí)間: 2025-3-22 22:44

作者: 確定的事    時(shí)間: 2025-3-23 04:39
Supervised Probabilistic Classification Based on Gaussian Copulassks. A copula is a distribution function with the implicit capacity to model non linear dependencies via concordance measures, such as Kendall’s .. Hence, this work studies the performance of a simple probabilistic classifier based on the Gaussian copula function. Without additional preprocessing of
作者: Vasoconstrictor    時(shí)間: 2025-3-23 06:26

作者: Vasodilation    時(shí)間: 2025-3-23 13:22

作者: cravat    時(shí)間: 2025-3-23 16:43
Real Time Tracking of Musical Performancesr singers, and automatic adding of special effects in live presentations..State of the art approaches make a local alignment of the score (the target audio) and a musical performance, such procedure induce cumulative error since it assumes the rendition to be well tracked up to the current time. We
作者: 獎(jiǎng)牌    時(shí)間: 2025-3-23 19:45
Recognizing Dactylogical Symbols with Image Segmentation and a New Differentiated Weighting Schemed weighting scheme on them. As an application example, we use a set of digital images that represent the various symbols contained in the dactylogical alphabet. First we introduce the reader to the many pre-processing and segmentation techniques applied to the set of images. Later on, we describe th
作者: Intellectual    時(shí)間: 2025-3-23 23:01

作者: 顯微鏡    時(shí)間: 2025-3-24 02:24
Recognizing Textual Entailment Using a Machine Learning Approacho classify the entailment pairs we use a symmetric similarity measure and a non-symmetric similarity measure. Our system achieved an accuracy of 66% on the RTE-3 development dataset (with 10-fold cross validation) and accuracy of 63% on the RTE-3 test dataset.
作者: 地名詞典    時(shí)間: 2025-3-24 07:30

作者: Serenity    時(shí)間: 2025-3-24 10:57

作者: 他一致    時(shí)間: 2025-3-24 18:36

作者: Injunction    時(shí)間: 2025-3-24 23:00
CBR and Neural Networks Based Technique for Predictive Prefetching page faults. Plenty of techniques are available to devise strong prediction mechanism for prefetching but they either are situation specific (Locality of reference principle) or inadaptable (Markovian model) and costly. We have proposed a generic and adaptable technique benefiting from past experie
作者: 語(yǔ)言學(xué)    時(shí)間: 2025-3-25 01:13
Grigori Sidorov,Arturo Hernández Aguirre,Carlos AlState-of-the-art research.Fast-track conference proceedings.Unique visibility
作者: 乳白光    時(shí)間: 2025-3-25 07:18
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/149750.jpg
作者: 高度    時(shí)間: 2025-3-25 08:52

作者: 高射炮    時(shí)間: 2025-3-25 12:39
978-3-642-16772-0Springer Berlin Heidelberg 2010
作者: 欲望    時(shí)間: 2025-3-25 17:23

作者: vocation    時(shí)間: 2025-3-25 23:42

作者: Monotonous    時(shí)間: 2025-3-26 03:05

作者: manifestation    時(shí)間: 2025-3-26 05:07

作者: 相互影響    時(shí)間: 2025-3-26 11:33

作者: receptors    時(shí)間: 2025-3-26 14:47

作者: 奇怪    時(shí)間: 2025-3-26 19:32

作者: 財(cái)產(chǎn)    時(shí)間: 2025-3-27 00:21
Megha Quamara,Christina Kolb,Brahim Hamidnerating all typical testors of a training matrix is computationally expensive; all reported algorithms have exponential complexity, depending mainly on the number of columns in the training matrix. For this reason, different approaches such as sequential and parallel algorithms, genetic algorithms
作者: 牽索    時(shí)間: 2025-3-27 02:51
Lecture Notes in Computer Sciencesks. A copula is a distribution function with the implicit capacity to model non linear dependencies via concordance measures, such as Kendall’s .. Hence, this work studies the performance of a simple probabilistic classifier based on the Gaussian copula function. Without additional preprocessing of
作者: 群居動(dòng)物    時(shí)間: 2025-3-27 07:22
https://doi.org/10.1007/978-3-031-40953-0 possible to use all type of feature extraction and modeling techniques to design a single classifier for speaker identification tasks because it will make the system complex. So instead of exploring more techniques or making the system complex it is more reasonable to develop the classifier by usin
作者: 母豬    時(shí)間: 2025-3-27 09:41
Fuzzy Logic in Computer Scienceuracy via an appropriate choices of features which can be chosen automatically. The importance of this work is that while one-class is often the appropriate classification setting for identifying cognitive brain functions, most work in the literature has focused on two-class methods..Our work extend
作者: 向下    時(shí)間: 2025-3-27 15:12

作者: 新娘    時(shí)間: 2025-3-27 18:57
Michael Benedikt,Pierre Senellartd weighting scheme on them. As an application example, we use a set of digital images that represent the various symbols contained in the dactylogical alphabet. First we introduce the reader to the many pre-processing and segmentation techniques applied to the set of images. Later on, we describe th
作者: Ascendancy    時(shí)間: 2025-3-28 00:02

作者: cortex    時(shí)間: 2025-3-28 05:56

作者: FICE    時(shí)間: 2025-3-28 08:12
Update Languages vs. Query Languagesnts and specific combinations of words within their language they decide to follow. Although capturing this style has proven to be very difficult, some advances have been achieved. Here, we present a novel system that is trained with texts from the same author, and is able to unveil some of its feat
作者: 重力    時(shí)間: 2025-3-28 11:20

作者: Malcontent    時(shí)間: 2025-3-28 14:51
Vladimir Estivill-Castro,Derick Woode from the Bayesian network. Through the use of these unlabeled nodes, we are able to restructure these trees, and reduce the amount of computation performed during the inference process. Empirical tests show that the algorithm can reduce multiplications by up to 70%, and overall runtime by up to 50
作者: 使迷惑    時(shí)間: 2025-3-28 18:53
https://doi.org/10.1007/978-3-642-03351-3 page faults. Plenty of techniques are available to devise strong prediction mechanism for prefetching but they either are situation specific (Locality of reference principle) or inadaptable (Markovian model) and costly. We have proposed a generic and adaptable technique benefiting from past experie
作者: 終端    時(shí)間: 2025-3-29 02:28
Elkan’s k-Means Algorithm for Graphsrading computational time against solution quality, we avoid unnecessary graph distance calculations by exploiting the triangle inequality of the underlying distance metric. In experiments we show that the accelerated k-means for graphs is faster than k-means for graphs provided there is a cluster structure in the data.
作者: 阻礙    時(shí)間: 2025-3-29 07:02
Methods and Algorithms of Information Generalization in Noisy Databasesise is considered. Noise models are presented, and a noise effect on the operation of generalization algorithms using the methods of building decision trees and forming production rules is developed. The results of program modeling are brought about.
作者: gregarious    時(shí)間: 2025-3-29 07:27
Recognizing Textual Entailment Using a Machine Learning Approacho classify the entailment pairs we use a symmetric similarity measure and a non-symmetric similarity measure. Our system achieved an accuracy of 66% on the RTE-3 development dataset (with 10-fold cross validation) and accuracy of 63% on the RTE-3 test dataset.
作者: 遺傳學(xué)    時(shí)間: 2025-3-29 15:28

作者: 設(shè)想    時(shí)間: 2025-3-29 17:45
Advances in Soft Computing978-3-642-16773-7Series ISSN 0302-9743 Series E-ISSN 1611-3349
作者: 過(guò)剩    時(shí)間: 2025-3-29 23:10

作者: 在駕駛    時(shí)間: 2025-3-30 02:11
Lecture Notes in Computer Scienceise is considered. Noise models are presented, and a noise effect on the operation of generalization algorithms using the methods of building decision trees and forming production rules is developed. The results of program modeling are brought about.
作者: 違反    時(shí)間: 2025-3-30 04:56

作者: 嚴(yán)厲譴責(zé)    時(shí)間: 2025-3-30 08:39

作者: frozen-shoulder    時(shí)間: 2025-3-30 13:50

作者: intrude    時(shí)間: 2025-3-30 18:20
Megha Quamara,Christina Kolb,Brahim Hamidoperty, because its implementation decreases the number of operations involved in the process of generating all typical testors. In addition, experimental results using the proposed fast implementation of the CT_EXT algorithm and the comparison with other state of the art algorithms that generated t
作者: 干涉    時(shí)間: 2025-3-31 00:30
Update Languages vs. Query Languagesen the unknown text is from a different author, otherwise the authorship is the same. The decision threshold is obtained by the self-organizing map trained with the texts from the same author. We present results in authorship identification in several contexts including classic literature, journalis
作者: 友好關(guān)系    時(shí)間: 2025-3-31 03:01

作者: Compass    時(shí)間: 2025-3-31 06:13

作者: 止痛藥    時(shí)間: 2025-3-31 11:11
A Fast Implementation of the CT_EXT Algorithm for the Testor Property Identificationoperty, because its implementation decreases the number of operations involved in the process of generating all typical testors. In addition, experimental results using the proposed fast implementation of the CT_EXT algorithm and the comparison with other state of the art algorithms that generated t
作者: 束以馬具    時(shí)間: 2025-3-31 16:30

作者: Gossamer    時(shí)間: 2025-3-31 19:06

作者: 桶去微染    時(shí)間: 2025-4-1 01:25
Conference proceedings 2010nowledge, solving problems and practically all other human intellectual abilities. Usually it is characterized by the application of heuristic methods because in the majority of cases there is no exact solution to this kind of problem. Soft computing can be viewed as a branch of AI that deals with t
作者: 迅速成長(zhǎng)    時(shí)間: 2025-4-1 02:22
Mona Gierl,Reiner Kriesten,Eric Saxndency aiming to accurately predict label combinations. An experimental study using decision trees, a kernel method as well as Na?ve Bayes as base-learning techniques shows the potential of the proposed approach to improve the multi-label classification performance.
作者: Cantankerous    時(shí)間: 2025-4-1 08:51

作者: ANTI    時(shí)間: 2025-4-1 13:05

作者: 縱火    時(shí)間: 2025-4-1 18:10

作者: 不發(fā)音    時(shí)間: 2025-4-1 18:50





歡迎光臨 派博傳思國(guó)際中心 (http://www.pjsxioz.cn/) Powered by Discuz! X3.5
西峡县| 雷波县| 沁阳市| 江西省| 隆子县| 五家渠市| 屏东市| 清苑县| 喀喇沁旗| 红河县| 东宁县| 阿克| 陆河县| 保定市| 拜泉县| 禄丰县| 正宁县| 启东市| 陆川县| 荣昌县| 海安县| 枣庄市| 云林县| 高要市| 集贤县| 深圳市| 清水县| 巴林右旗| 安远县| 五华县| 湛江市| 阆中市| 阿荣旗| 洪泽县| 囊谦县| 广元市| 柳林县| 健康| 武功县| 灌阳县| 阳曲县|