標(biāo)題: Titlebook: Logical Foundations for Rule-Based Systems; Antoni Ligêza Book 2006Latest edition Springer-Verlag Berlin Heidelberg 2006 Prolog.Rule-Based [打印本頁] 作者: Clinton 時間: 2025-3-21 18:49
書目名稱Logical Foundations for Rule-Based Systems影響因子(影響力)
書目名稱Logical Foundations for Rule-Based Systems影響因子(影響力)學(xué)科排名
書目名稱Logical Foundations for Rule-Based Systems網(wǎng)絡(luò)公開度
書目名稱Logical Foundations for Rule-Based Systems網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Logical Foundations for Rule-Based Systems被引頻次
書目名稱Logical Foundations for Rule-Based Systems被引頻次學(xué)科排名
書目名稱Logical Foundations for Rule-Based Systems年度引用
書目名稱Logical Foundations for Rule-Based Systems年度引用學(xué)科排名
書目名稱Logical Foundations for Rule-Based Systems讀者反饋
書目名稱Logical Foundations for Rule-Based Systems讀者反饋學(xué)科排名
作者: 排他 時間: 2025-3-21 21:39 作者: olfction 時間: 2025-3-22 00:26
aims to match the surveillance images containing the same person. However, the performance of these methods is usually very sensitive to the change of the hyper-parameters in the clustering methods, such as the maximum distance of the neighbors and the number of clusters, which determine the qualit作者: 失敗主義者 時間: 2025-3-22 07:18
er may be interested in. It plays a crucial role in location-based services. Most existing spatial knowledge modeling methods cannot simultaneously consider spatial locations’ relationship and spatial movement periodicity in check-in sequence. Additionally, these methods model user preference knowle作者: Unsaturated-Fat 時間: 2025-3-22 12:48 作者: 木訥 時間: 2025-3-22 15:15 作者: 平息 時間: 2025-3-22 20:44 作者: 水汽 時間: 2025-3-22 23:34
re generally similar in contour and lack complete semantic information of the image. Simultaneously, due to the inherent ambiguity of hand-drawn images, there is “one-to-many” category mapping relationship between hand-drawn and natural images. To accurately improve the fine-grained retrieval result作者: 不能強迫我 時間: 2025-3-23 04:13
n a given video. However, the useful detection and tracklet relationship during the tracking process are not fully explored in most current algorithms and it leads to the accumulation of errors. We introduce a novel Detection Group, which includes the detections within a temporal and spatial thresho作者: 該得 時間: 2025-3-23 07:58 作者: CONE 時間: 2025-3-23 10:18 作者: innate 時間: 2025-3-23 16:53
ions have to deal with the inherent imperfection of situation recognition for decision making. The current researches of situation-aware focused on situation recognition based on modeling, classifying and apperceiving of context information, which were insufficiency in the researches and utilization作者: Armory 時間: 2025-3-23 20:59 作者: headway 時間: 2025-3-23 22:37 作者: obtuse 時間: 2025-3-24 05:54
ntence search. The traditional calculation of text similarity constructed text vectors only based on TF-IDF, and used the cosine of the angle between vectors to measure the similarity between two texts. However, this method cannot solve the similar text detection task with different text representat作者: 組裝 時間: 2025-3-24 08:38 作者: 宣傳 時間: 2025-3-24 12:42 作者: Pander 時間: 2025-3-24 15:49 作者: 蒼白 時間: 2025-3-24 22:32 作者: Defense 時間: 2025-3-25 02:45
their interests to enhance the activeness and retention of users. Besides, their interests change from time to time. Session-based recommendation divides users’ interaction history into sessions and predict users’ behaviors with the context information in each session. It’s essential but challenging作者: 雕鏤 時間: 2025-3-25 07:20
978-3-642-06709-9Springer-Verlag Berlin Heidelberg 2006作者: Reverie 時間: 2025-3-25 11:25
Logical Foundations for Rule-Based Systems978-3-540-32446-1Series ISSN 1860-949X Series E-ISSN 1860-9503 作者: laparoscopy 時間: 2025-3-25 12:15 作者: 滑稽 時間: 2025-3-25 18:51 作者: BYRE 時間: 2025-3-25 21:16 作者: Allergic 時間: 2025-3-26 03:54
ed to feed in more implicit information. Extensive experiments on three real-world datasets show that ST-MAN not only outperforms state-of-the-art methods in all aspects, but also has high computational efficiency. Moreover, the framework is easily generalized to include more data modalities.作者: Priapism 時間: 2025-3-26 06:41
clinical entity mentioned in a doctor-patient dialog turn requires the information across the whole dialog rather than only the current turn. To bridge the gap, we further propose CLINER, a .inical .nterrogation NER model, which exploits both fine-grained and coarse-grained information for each dial作者: 空氣 時間: 2025-3-26 11:21
Loose and Tight Bounds to alleviate two kinds of clustering errors. Based on these bounds, a novel Loose-Tight alternate clustering strategy is adopted to optimize the visual model iteratively. Furthermore, a quality measurement based learning method is proposed to mitigate the side-effects of the 作者: 背信 時間: 2025-3-26 14:45 作者: ARIA 時間: 2025-3-26 18:18
-OREES. To test the generality of DTRD algorithm, we also combined DTRD algorithm with the existing EFSRG algorithm as D-EFSRG algorithm. In the experimental part, the simulation scheduling results of FFT applications, GE applications and random applications show that the dynamic scheduling algorith作者: OUTRE 時間: 2025-3-26 22:28 作者: 天氣 時間: 2025-3-27 04:37
s. Moreover, WalkToTopics is a general model that also can work on exploring topic clusters or extracting sentiments, and can be applied to potential applications, such as ideas tracking and opinion summarization. Finally, we conducted two studies for common users and experts which both quantitative作者: anus928 時間: 2025-3-27 09:17
es in vector space so that the neural network can achieve fine-grained image feature learning. This is the first time that we propose to solve the problem of personalization in the field of sketch retrieval by the idea of transfer learning. After the model migration, we can achieve fine-grained imag作者: Entrancing 時間: 2025-3-27 13:29 作者: GEON 時間: 2025-3-27 14:57 作者: ARENA 時間: 2025-3-27 19:06
e focus on a class of DL ontologies called the first-order rewritable class. We propose a tractable method for computing a minimal representative set of ABox repairs in an inconsistent first-order rewritable ontology. Experimental results demonstrate the high efficiency and scalability of the propos
