標(biāo)題: Titlebook: Database Systems for Advanced Applications; 24th International C Guoliang Li,Jun Yang,Yongxin Tong Conference proceedings 2019 Springer Nat [打印本頁] 作者: 債權(quán)人 時間: 2025-3-21 17:06
書目名稱Database Systems for Advanced Applications影響因子(影響力)
書目名稱Database Systems for Advanced Applications影響因子(影響力)學(xué)科排名
書目名稱Database Systems for Advanced Applications網(wǎng)絡(luò)公開度
書目名稱Database Systems for Advanced Applications網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Database Systems for Advanced Applications被引頻次
書目名稱Database Systems for Advanced Applications被引頻次學(xué)科排名
書目名稱Database Systems for Advanced Applications年度引用
書目名稱Database Systems for Advanced Applications年度引用學(xué)科排名
書目名稱Database Systems for Advanced Applications讀者反饋
書目名稱Database Systems for Advanced Applications讀者反饋學(xué)科排名
作者: notice 時間: 2025-3-21 23:03
An Exploration of Cross-Modal Retrieval for Unseen Concepts of the existing models are trained and tested in a close-set circumstance, which may easily fail on the newly emerged concepts that are never present in the training stage. In this paper, we propose a novel cross-modal hashing model, named Cross-Modal Attribute Hashing (CMAH), which can handle cros作者: 感激小女 時間: 2025-3-22 03:31
Continuous Patient-Centric Sequence Generation via Sequentially Coupled Adversarial Learningnt of these data is limited and the access to EHRs is difficult due to the issue of patient privacy. Thus high quality synthetic EHRs data is necessary to alleviate these issues. In this paper, we propose a Sequentially Coupled Generative Adversarial Network (SC-GAN) to generate continuous patient-c作者: 漫步 時間: 2025-3-22 08:03 作者: 戲法 時間: 2025-3-22 11:35 作者: 使成核 時間: 2025-3-22 16:09 作者: 使成核 時間: 2025-3-22 20:09
Reinforcement Learning to Diversify Top-N RecommendationTraditional approaches are to treat the process of constructing the recommendation list as a problem of greedy sequential items selection, which are inevitably sub-optimal. In this paper, we propose a reinforcement learning and neural networks based framework?– .ersify top-N Recommendation with .ast作者: 慢慢流出 時間: 2025-3-22 23:35 作者: 群居動物 時間: 2025-3-23 02:37 作者: 決定性 時間: 2025-3-23 07:20 作者: 聲明 時間: 2025-3-23 10:35
Using Fractional Latent Topic to Enhance Recurrent Neural Network in Text Similarity Modelinge classical topic models, a text contains many different latent topics, and the complete semantic information of the text is described by all the latent topics. Previous RNN based models usually learn the text representation with the separated words in the text instead of topics, which will bring no作者: conduct 時間: 2025-3-23 16:44 作者: Incommensurate 時間: 2025-3-23 22:03
Efficient Local Search for Minimum Dominating Sets in Large Graphsw local search algorithm ScBppw (Score Checking and Best-picking with Probabilistic Walk) to solve the MinDS problem in large graphs. For diversifying the search, our algorithm exploits a tabu strategy, called Score Checking (SC), which forbids a vertex to be added into the current candidate solutio作者: 假 時間: 2025-3-23 22:58
Multi-level Graph Compression for Fast Reachability Detectionhability based on that index. For these approaches, the index construction time and index size can become a concern for large graphs. More recently query-preserving graph compression has been proposed and searching reachability over the compressed graph has been shown to be able to significantly imp作者: 漸強 時間: 2025-3-24 04:15 作者: abreast 時間: 2025-3-24 08:11 作者: 文字 時間: 2025-3-24 12:56 作者: 胰臟 時間: 2025-3-24 15:06 作者: 否認(rèn) 時間: 2025-3-24 21:40
Martin Heidegger and Daoism in Dialogue structure information in each modality and to reduce quantization loss, respectively. Extensive experiments are carried out on three datasets, and the results demonstrate the effectiveness of CMAH in handling cross-modal retrieval for both seen and unseen concepts.作者: 匍匐前進(jìn) 時間: 2025-3-25 02:08 作者: Consequence 時間: 2025-3-25 04:12 作者: N防腐劑 時間: 2025-3-25 11:28 作者: 全等 時間: 2025-3-25 12:59
Gurpreet Sodhi MD,Ramesh Singh MDlearns user community by using community detection method and message clustering by using short texts clustering algorithm from social contextual information on the basis of homophily assumption, respectively. Then CBRMF incorporates the impacts of homophily characteristics on users and messages as 作者: Sigmoidoscopy 時間: 2025-3-25 15:53
Organ and Tissue Transplantation, to alleviate the staleness problem, SGC updates model weight with the accumulation of delayed gradients at local, called local update technique. The experiments over the sparse high-dimensional models and deep neural networks indicate that SGC can compress 99.99% gradients for every iteration with作者: 直覺沒有 時間: 2025-3-25 20:09 作者: Fillet,Filet 時間: 2025-3-26 01:42 作者: 寬大 時間: 2025-3-26 04:22
The Xie Family in Yokohama Chinatown,rtional to the their degrees, depending on how repeatedly the area has been visited. Experimental results show that our solver significantly outperforms state-of-the-art MinDS solvers. Also we conducted several experiments to show the individual impacts of our novelties.作者: committed 時間: 2025-3-26 11:52
Losers, meritocracy, and Identificationtinuous distribution. We also provide an Adapt estimator which assigns users to use different LDP schemes based on their regimes, and it performs better than the estimator with only one fixed LDP scheme. Experiments show that our methods provide a higher level of accuracy than previous proposals in 作者: 沒有貧窮 時間: 2025-3-26 16:06 作者: Instantaneous 時間: 2025-3-26 17:21
Losers, meritocracy, and Identification reduce the computation overhead, we introduce an influence model to store the encrypted point data (restaurant). Besides the stronger security, this work is a practical polynomial evaluation algorithm over the road network. The practicality is mainly manifested in two aspects: evaluation over multi作者: 多產(chǎn)子 時間: 2025-3-26 23:02 作者: 連詞 時間: 2025-3-27 04:59 作者: LEVER 時間: 2025-3-27 07:28 作者: AMPLE 時間: 2025-3-27 11:34 作者: Anemia 時間: 2025-3-27 15:28 作者: Daily-Value 時間: 2025-3-27 20:15 作者: 一條卷發(fā) 時間: 2025-3-27 22:45
Sparse Gradient Compression for Distributed SGD, to alleviate the staleness problem, SGC updates model weight with the accumulation of delayed gradients at local, called local update technique. The experiments over the sparse high-dimensional models and deep neural networks indicate that SGC can compress 99.99% gradients for every iteration with作者: Blazon 時間: 2025-3-28 03:11 作者: 錫箔紙 時間: 2025-3-28 09:44
Using Fractional Latent Topic to Enhance Recurrent Neural Network in Text Similarity Modelingattention gating mechanism and embed it into our model to generate the topic-level attentive vector for each topic. Finally, we reward the topic perspective with the topic-level attention for text representation. Experiments on four benchmark datasets, namely TREC-QA and WikiQA for answer selection,作者: 女上癮 時間: 2025-3-28 12:23
Efficient Local Search for Minimum Dominating Sets in Large Graphsrtional to the their degrees, depending on how repeatedly the area has been visited. Experimental results show that our solver significantly outperforms state-of-the-art MinDS solvers. Also we conducted several experiments to show the individual impacts of our novelties.作者: 燈絲 時間: 2025-3-28 16:14
Multiple Privacy Regimes Mechanism for Local Differential Privacytinuous distribution. We also provide an Adapt estimator which assigns users to use different LDP schemes based on their regimes, and it performs better than the estimator with only one fixed LDP scheme. Experiments show that our methods provide a higher level of accuracy than previous proposals in 作者: 小蟲 時間: 2025-3-28 19:06
Privacy Preserving Elastic Stream Processing with Clouds Using Homomorphic Encryptiondes significant results which is 10% to 17% improvement of average latency in the case of email filter benchmark and EDGAR benchmarks respectively. Furthermore, EDGAR add/subtract operations and comparison operations showed 6.13% and 26.17% average latency improvements respectively. These promising 作者: 寬大 時間: 2025-3-29 01:07
Select the Best for Me: Privacy-Preserving Polynomial Evaluation Algorithm over Road Network reduce the computation overhead, we introduce an influence model to store the encrypted point data (restaurant). Besides the stronger security, this work is a practical polynomial evaluation algorithm over the road network. The practicality is mainly manifested in two aspects: evaluation over multi作者: 羞辱 時間: 2025-3-29 07:06 作者: 同義聯(lián)想法 時間: 2025-3-29 09:24
Database Systems for Advanced Applications978-3-030-18579-4Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Consensus 時間: 2025-3-29 12:53
https://doi.org/10.1007/978-3-031-26779-6 model makes simplifying assumptions in order to produce said estimates in a timely manner. These assumptions lead to selectivity estimation errors that have dramatic effects on the quality of the resulting query execution plans. A convenient assumption that is ubiquitous among current cost models i作者: Audiometry 時間: 2025-3-29 17:55 作者: 大火 時間: 2025-3-29 21:29
https://doi.org/10.1057/978-1-349-95359-2nt of these data is limited and the access to EHRs is difficult due to the issue of patient privacy. Thus high quality synthetic EHRs data is necessary to alleviate these issues. In this paper, we propose a Sequentially Coupled Generative Adversarial Network (SC-GAN) to generate continuous patient-c作者: 同音 時間: 2025-3-30 01:36
https://doi.org/10.1057/978-1-349-95359-2 in the intensive care unit (ICU). However, the central role of diagnosis in clinical practice is challenged by evidence that does not always benefit patients and that factors other than disease are important in determining patient outcome. To streamline the diagnostic process in daily routine and a作者: MERIT 時間: 2025-3-30 05:24 作者: Complement 時間: 2025-3-30 10:37 作者: Aura231 時間: 2025-3-30 12:39 作者: incontinence 時間: 2025-3-30 16:39 作者: SPALL 時間: 2025-3-30 22:48 作者: 分貝 時間: 2025-3-31 02:18
Donor Operation and Organ Preservationing navigation, traffic monitoring, route planning, and ride sharing, etc. However, it is a challenging problem mainly due to the complicate spatial-temporal dependencies, external weather conditions, road types and so on. Most traditional approaches mainly fall into the sub-segments or sub-paths ca作者: Exonerate 時間: 2025-3-31 07:20 作者: 梯田 時間: 2025-3-31 12:57
Contemporary Heart Transplantationt, meaning that they consist of items that co-occur in transactions more often than a given threshold, and that are maximal, meaning that they are not contained in other frequent itemsets. Such itemsets are the most interesting ones in a meaningful sense. We study the problem of efficiently finding 作者: Pantry 時間: 2025-3-31 16:48
