標(biāo)題: Titlebook: Database and Expert Systems Applications; 34th International C Christine Strauss,Toshiyuki Amagasa,Ismail Khalil Conference proceedings 202 [打印本頁] 作者: 厭氧 時(shí)間: 2025-3-21 17:05
書目名稱Database and Expert Systems Applications影響因子(影響力)
書目名稱Database and Expert Systems Applications影響因子(影響力)學(xué)科排名
書目名稱Database and Expert Systems Applications網(wǎng)絡(luò)公開度
書目名稱Database and Expert Systems Applications網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Database and Expert Systems Applications被引頻次
書目名稱Database and Expert Systems Applications被引頻次學(xué)科排名
書目名稱Database and Expert Systems Applications年度引用
書目名稱Database and Expert Systems Applications年度引用學(xué)科排名
書目名稱Database and Expert Systems Applications讀者反饋
書目名稱Database and Expert Systems Applications讀者反饋學(xué)科排名
作者: Asymptomatic 時(shí)間: 2025-3-21 23:03
Controlling in Virtuellen NetzwerkenKG summarization is a challenging task under real-world resource constraints such as memories and response time. We present scalable utility-driven algorithms for summarizing large-scale KGs based on the features of entities. Specifically, we propose the notion of utility for KG summaries and develo作者: Axon895 時(shí)間: 2025-3-22 01:59
https://doi.org/10.1007/978-3-658-04946-1 the infusion of humor in a dialogue system will improve the user’s physical and mental satisfaction. Since even humans have difficulty comprehending humor, appropriate knowledge is essential for humor understanding. In this paper, commonsense-aware modules are extrapolated to .re-trained .anguage .作者: Genome 時(shí)間: 2025-3-22 07:05 作者: Functional 時(shí)間: 2025-3-22 12:13
Walid Mehanna,Chris Marcus Rabelt diversification aims at retrieving the . nearest objects to each reference entry that are dissimilar among themselves. Under the Metric Space Model, the distance-based ternary relationship between each search reference, the dataset, and the result set can be explicitly used to define a coverage-b作者: 變量 時(shí)間: 2025-3-22 15:35
https://doi.org/10.1007/978-3-658-04946-1on of the mathematical model that we carved to fit the operational needs of .. Afterwards, we propose . able to solve the problem in a faster way with .. The heuristic algorithms proposed in our framework progressively reach a good approximation of the solution. Experimental results confirm the bene作者: 變量 時(shí)間: 2025-3-22 20:20 作者: 譏諷 時(shí)間: 2025-3-23 00:55
https://doi.org/10.1007/978-3-322-81101-1nal resources and access to archival storage. In this paper, we study features that capture the evolving relationship between raw data features and target labels, and techniques to extract those features. In particular, we focus on the relationship between feature importance measures in streaming da作者: 四目在模仿 時(shí)間: 2025-3-23 04:32
https://doi.org/10.1007/978-3-322-89083-2 for their funding sources to prove that these machines are being utilized and meeting the availability requirements. While tracking the state of an individual server is trivial, measuring uptime of a supercomputer with several thousand nodes spanning tens to hundreds of cabinets and rows with one o作者: faddish 時(shí)間: 2025-3-23 08:21
Telekooperation: Die Rolle von Distanzen,m of data stream collection under LDP is the poor utility due to multi-item collection from a very large domain. This paper proposes PrivSketch, a high-utility frequency estimation protocol taking advantage of sketches, suitable for private data stream collection. Combining the proposed background i作者: 腐敗 時(shí)間: 2025-3-23 13:35
https://doi.org/10.1007/978-3-658-31316-6 are not free from errors, which include among others wrong and missing values as well as duplicates. Data deduplication has received a lot of attention from the research community. The research efforts have resulted in a state-of-the-art data deduplication pipeline, supported by software tools and 作者: 摻假 時(shí)間: 2025-3-23 14:24
Allgemeiner Managementkreislaufuerying semantic evolved data, which conciliate the multiple versions the data may have. An implementation of the model and algorithms, MellowDB, was developed, and its performance was analyzed, showing the proposed algorithms and model are feasible.作者: 貪婪的人 時(shí)間: 2025-3-23 22:05 作者: delta-waves 時(shí)間: 2025-3-23 23:53
Timothy Kaufmann,Karsten Oehlers to launch tuning requests periodically, yet resource-intensive tuning sessions can obstruct it, particularly when dealing with frequently varying workloads..To tackle this challenge, we propose a learned tuning diagnostic that can be incorporated into the . paradigm for online index tuning. Rather作者: 變態(tài) 時(shí)間: 2025-3-24 05:39
Controlling mit der SAP Analytics Cloudmulti-dimensional data applications are generally data-intensive, array databases can benefit from multi-processing systems to improve performance. However, when dealing with Non-Uniform Memory Access (NUMA) machines, the movement of massive amounts of data across NUMA nodes may result in significan作者: adequate-intake 時(shí)間: 2025-3-24 09:05
https://doi.org/10.34157/978-3-648-17372-5mework of LDP, before they are transmitted to the server. This technology can be applied to various data types, including key-value data. However, in existing LDP mechanisms for key-value data, it is difficult to balance data utility and communication costs, particularly when the domain of keys is l作者: 察覺 時(shí)間: 2025-3-24 11:03 作者: lipids 時(shí)間: 2025-3-24 18:24 作者: GROWL 時(shí)間: 2025-3-24 21:55 作者: Banquet 時(shí)間: 2025-3-24 23:42
Effective and?Efficient Heuristic Algorithms for?Supporting Optimal Location of?Hubs over?Networks won of the mathematical model that we carved to fit the operational needs of .. Afterwards, we propose . able to solve the problem in a faster way with .. The heuristic algorithms proposed in our framework progressively reach a good approximation of the solution. Experimental results confirm the benefits of our approach.作者: 抗體 時(shí)間: 2025-3-25 04:41 作者: 折磨 時(shí)間: 2025-3-25 10:16 作者: 昏暗 時(shí)間: 2025-3-25 13:15 作者: 社團(tuán) 時(shí)間: 2025-3-25 18:26
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/d/image/263487.jpg作者: 消滅 時(shí)間: 2025-3-25 20:44
Controlling in Virtuellen Netzwerken is about two orders of magnitude better in terms of speed. Third, we present a query evaluation algorithm over KGs based on SiFS and ScFS. The experiments results show that the proposed summaries facilitate efficient and high-quality KG queries.作者: 不要嚴(yán)酷 時(shí)間: 2025-3-26 02:23 作者: 物種起源 時(shí)間: 2025-3-26 07:13
Walid Mehanna,Chris Marcus Rabealgorithms: the P-BRID. and the SP-BRID.. The P-BRID. method relies on partitioning the objects by their proximity to a set of . so that the search space locality is preserved throughout the mapped distance-based comparisons. The SP-BRID. method expands the P-BRID. by using a data replication strate作者: 安心地散步 時(shí)間: 2025-3-26 08:35 作者: ALOFT 時(shí)間: 2025-3-26 13:50 作者: 責(zé)難 時(shí)間: 2025-3-26 19:26 作者: Reclaim 時(shí)間: 2025-3-26 23:04
Timothy Kaufmann,Karsten Oehlernstance, we propose a transferable representation of queries and indexes that allows for cross-database learning. Our comprehensive empirical results on the TPC-H and TPC-DS benchmarks demonstrate that our approach can reduce the total time by up to 13.3% and the number of optimizer what-if calls by作者: FLAGR 時(shí)間: 2025-3-27 03:19 作者: nitric-oxide 時(shí)間: 2025-3-27 08:11 作者: 狗窩 時(shí)間: 2025-3-27 11:04 作者: Omnipotent 時(shí)間: 2025-3-27 15:59
Commonsense-Aware Attentive Modeling for?Humor Recognitionur best model significantly improves recall by 4.4% for a 0.4% reduction in precision in the HaHackathon dataset and by 20.3% for an 8.4% reduction in precision in the Humicroedit dataset compared to the baseline. We also observe the changes in prediction and processing speed so as to analyze the ch作者: fidelity 時(shí)間: 2025-3-27 21:16
Adding Result Diversification to?,NN-Based Joins in?a?Map-Reduce Frameworkalgorithms: the P-BRID. and the SP-BRID.. The P-BRID. method relies on partitioning the objects by their proximity to a set of . so that the search space locality is preserved throughout the mapped distance-based comparisons. The SP-BRID. method expands the P-BRID. by using a data replication strate作者: 占卜者 時(shí)間: 2025-3-28 01:37 作者: 激勵(lì) 時(shí)間: 2025-3-28 02:07 作者: 不斷的變動(dòng) 時(shí)間: 2025-3-28 10:19 作者: EXALT 時(shí)間: 2025-3-28 13:40 作者: ungainly 時(shí)間: 2025-3-28 15:37 作者: 執(zhí)拗 時(shí)間: 2025-3-28 20:10
LHKV: A Key-Value Data Collection Mechanism Under Local Differential Privacyconduct experiments to demonstrate that, in comparison with the existing mechanisms, LHKV can effectively reduce communication costs without sacrificing utility while ensuring the same LDP guarantees.作者: Organization 時(shí)間: 2025-3-29 00:42
Co-location Pattern Mining Under the?Spatial Structure Constrainticle proposes CSS-Miner, a co-location pattern mining approach under the spatial structure constraint. In this case, the street network of a city is used as a constraint. CSS-Miner has been applied to two real datasets with different points of interest.作者: 自然環(huán)境 時(shí)間: 2025-3-29 05:58
Conference proceedings 2023eviewed and selected from a total of 155 submissions. The papers are organized in topical sections as follows:.Part I: Data modeling; database design; query optimization; knowledge representation;?.Part II: Rule-based systems; natural language processing; deep learning; neural networks..作者: overbearing 時(shí)間: 2025-3-29 09:18 作者: 殘暴 時(shí)間: 2025-3-29 13:33
Controlling in der Konsumgüterindustrie technology frameworks: labeling based on text description, labeling based on patch analysis, and labeling based on vulnerability scanning. The proposed frameworks can be used to evaluate existing labeling methods and guide the future work on labeling vulnerability code samples, which can help form a better vulnerability code dataset.作者: 挑剔為人 時(shí)間: 2025-3-29 16:22 作者: 戲法 時(shí)間: 2025-3-29 22:21 作者: 浪費(fèi)物質(zhì) 時(shí)間: 2025-3-30 01:20 作者: flutter 時(shí)間: 2025-3-30 05:38 作者: 拘留 時(shí)間: 2025-3-30 08:39 作者: 斜 時(shí)間: 2025-3-30 12:56 作者: Accrue 時(shí)間: 2025-3-30 18:09 作者: 獨(dú)輪車 時(shí)間: 2025-3-30 22:23 作者: 建筑師 時(shí)間: 2025-3-31 03:45
0302-9743 d Expert Systems Applications, DEXA 2023, held in Penang, Malaysia, in August 2023..The 49 full papers presented together with 35 short papers? were carefully reviewed and selected from a total of 155 submissions. The papers are organized in topical sections as follows:.Part I: Data modeling; databa作者: deforestation 時(shí)間: 2025-3-31 08:08 作者: 厭倦嗎你 時(shí)間: 2025-3-31 10:52 作者: 多節(jié) 時(shí)間: 2025-3-31 15:56 作者: analogous 時(shí)間: 2025-3-31 21:06
Commonsense-Aware Attentive Modeling for?Humor Recognition the infusion of humor in a dialogue system will improve the user’s physical and mental satisfaction. Since even humans have difficulty comprehending humor, appropriate knowledge is essential for humor understanding. In this paper, commonsense-aware modules are extrapolated to .re-trained .anguage .
