標(biāo)題: Titlebook: Database and Expert Systems Applications; 24th International C Hendrik Decker,Lenka Lhotská,A Min Tjoa Conference proceedings 2013 Springer [打印本頁(yè)] 作者: 使沮喪 時(shí)間: 2025-3-21 19:09
書(shū)目名稱(chēng)Database and Expert Systems Applications影響因子(影響力)
書(shū)目名稱(chēng)Database and Expert Systems Applications影響因子(影響力)學(xué)科排名
書(shū)目名稱(chēng)Database and Expert Systems Applications網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱(chēng)Database and Expert Systems Applications網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱(chēng)Database and Expert Systems Applications被引頻次
書(shū)目名稱(chēng)Database and Expert Systems Applications被引頻次學(xué)科排名
書(shū)目名稱(chēng)Database and Expert Systems Applications年度引用
書(shū)目名稱(chēng)Database and Expert Systems Applications年度引用學(xué)科排名
書(shū)目名稱(chēng)Database and Expert Systems Applications讀者反饋
書(shū)目名稱(chēng)Database and Expert Systems Applications讀者反饋學(xué)科排名
作者: 哥哥噴涌而出 時(shí)間: 2025-3-21 23:51 作者: aptitude 時(shí)間: 2025-3-22 04:28 作者: Etymology 時(shí)間: 2025-3-22 04:34 作者: cornucopia 時(shí)間: 2025-3-22 11:30 作者: AGOG 時(shí)間: 2025-3-22 14:53
Vector, Tensors, and Related Matters map the “nearby” objects into a same hash bucket with high probability. A significant drawback is that LSH requires a large number of hash tables to achieve good search quality. Multi-probe LSH was proposed to reduce the number of hash tables by looking up multiple buckets in each table. While opti作者: AGOG 時(shí)間: 2025-3-22 17:29
Continuum Mechanics and Linear Elasticityndexing. However, this way of indexing needs to revisit some hypotheses of classical Information Retrieval. Therefore, we propose a new concept weighting approach, namely ., which weights concepts with respect to their corresponding text in the documents or queries. In other words, it assigns to eac作者: 項(xiàng)目 時(shí)間: 2025-3-22 21:33
,Plasticity Over 150?Years (1864–2014),the dictionaries. However, it generates irrelevant information. We propose a new approach for indexing biomedical documents with the Medical Subject Headings (MeSH) thesaurus that aims to overcome the limitation of the partial match. In fact, our indexing approach proposes to restrict the stemming p作者: 因無(wú)茶而冷淡 時(shí)間: 2025-3-23 01:55
Kolumban Hutter Ph.D.,Klaus J?hnkmetimes the efficiency, of many tasks including query processing, keyword search and schema/data integration. The Object-Relationship-Attribute model for Semi-Structured data (ORA-SS) model is a conceptual model intended to capture the semantics of object classes, object identifiers, relationship ty作者: legislate 時(shí)間: 2025-3-23 07:00
Continuum Methods of Physical Modeling visual as well as in semantic space, but to accomplish this computationally is yet to be fully explored. The learning based techniques do minimize the semantic gap, but unlimited possible categorization of objects in real world is a major challenge to these techniques. This work analyzes and utiliz作者: 分散 時(shí)間: 2025-3-23 12:48
Kolumban Hutter Ph.D.,Klaus J?hnkimate CFDs and presenting three discovery algorithms ., . and . as extensions of existing algorithms with renewed techniques. First, . introduces a global FP-tree traversal for finding Right-hand Side items. Second, . uses a modified pruning strategy. Third, . adopts a minimal coverset that is used 作者: 條約 時(shí)間: 2025-3-23 13:58 作者: 的闡明 時(shí)間: 2025-3-23 20:25 作者: Evacuate 時(shí)間: 2025-3-23 23:26 作者: 合唱隊(duì) 時(shí)間: 2025-3-24 02:32
https://doi.org/10.1007/978-3-642-29500-3e federation. LAV mediators rely on query rewriters to translate mediator queries into equivalent queries on the federated data sources. The query rewriting problem in LAV mediators has shown to be NP-complete, and there may be an exponential number of rewritings, making unfeasible the execution or 作者: 奇怪 時(shí)間: 2025-3-24 08:52 作者: intimate 時(shí)間: 2025-3-24 12:27 作者: 合唱團(tuán) 時(shí)間: 2025-3-24 16:15
Database and Expert Systems Applications978-3-642-40285-2Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Recess 時(shí)間: 2025-3-24 20:51 作者: hieroglyphic 時(shí)間: 2025-3-25 00:31 作者: 繼而發(fā)生 時(shí)間: 2025-3-25 06:43 作者: 文件夾 時(shí)間: 2025-3-25 10:58
Taming Elephants, or How to Embed Parallelism into PostgreSQLThe paper describes the design and the implementation of PargreSQL parallel database management system (DBMS) for cluster systems. PargreSQL is based on PostgreSQL open-source DBMS and exploits partitioned parallelism. Presented experimental results show that this scheme is worthy of further development.作者: 忙碌 時(shí)間: 2025-3-25 11:58
https://doi.org/10.1007/978-3-642-40285-2artificial intelligence; business process models; data mining; graphs; information retrieval作者: anticipate 時(shí)間: 2025-3-25 16:21 作者: 兒童 時(shí)間: 2025-3-25 22:35 作者: 表示向前 時(shí)間: 2025-3-26 01:36
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/d/image/263466.jpg作者: 切掉 時(shí)間: 2025-3-26 05:32 作者: chuckle 時(shí)間: 2025-3-26 09:38
Angelo Marcello Anile,Vittorio Romanonciple of progressive refinement provides a great flexibility to the user that can not only dynamically decide to stop the process whenever the results satisfies his/her wishes, but can also navigates in the different levels of ranking and be aware of the level of reliability of each successive refi作者: cloture 時(shí)間: 2025-3-26 15:30 作者: Rejuvenate 時(shí)間: 2025-3-26 19:02 作者: 沒(méi)有貧窮 時(shí)間: 2025-3-26 22:27 作者: 積習(xí)難改 時(shí)間: 2025-3-27 04:28
https://doi.org/10.1007/978-3-642-29500-3 (ReMakE) as the problem of maximizing the query results obtained from the execution of only . rewritings. Additionally, a novel query execution strategy called GUN is proposed to solve the ReMakE problem. Our experimental evaluation demonstrates that GUN outperforms traditional techniques in terms 作者: 舔食 時(shí)間: 2025-3-27 06:40
Preferences Chain Guided Search and Ranking Refinementnciple of progressive refinement provides a great flexibility to the user that can not only dynamically decide to stop the process whenever the results satisfies his/her wishes, but can also navigates in the different levels of ranking and be aware of the level of reliability of each successive refi作者: 彎腰 時(shí)間: 2025-3-27 09:43
Finding Image Semantics from a Hierarchical Image Database Based on Adaptively Combined Visual Featuces the search space. The search space so obtained is further reduced by applying any one of the four proposed ‘Pruning Algorithms’. Pruning algorithms maintain accuracy while reducing the search space. These algorithms use an adaptive combination of multiple visual features of an image database to 作者: gain631 時(shí)間: 2025-3-27 16:37 作者: Gratuitous 時(shí)間: 2025-3-27 18:29 作者: 虛弱的神經(jīng) 時(shí)間: 2025-3-28 01:24
GUN: An Efficient Execution Strategy for Querying the Web of Data (ReMakE) as the problem of maximizing the query results obtained from the execution of only . rewritings. Additionally, a novel query execution strategy called GUN is proposed to solve the ReMakE problem. Our experimental evaluation demonstrates that GUN outperforms traditional techniques in terms 作者: Intruder 時(shí)間: 2025-3-28 03:13 作者: APNEA 時(shí)間: 2025-3-28 07:46 作者: Invigorate 時(shí)間: 2025-3-28 11:28
Formalization and Discovery of Approximate Conditional Functional Dependenciesobal FP-tree traversal for finding Right-hand Side items. Second, . uses a modified pruning strategy. Third, . adopts a minimal coverset that is used to exclude non-minimal approximate CFDs. For these algorithms, we theoretically proved the correctness and experimentally evaluated the performances.作者: 傷心 時(shí)間: 2025-3-28 17:30
Rheology and Nonlinear Elasticity,e enlargement, whereas vertical model integration refers to the systematic, seamless refinement process of high-level abstract (conceptual) models down to running systems. Our research on horizontal and vertical model integration has concentated on business process models. The results will be reported in the monograph [5].作者: 謊言 時(shí)間: 2025-3-28 19:44 作者: attenuate 時(shí)間: 2025-3-28 23:53 作者: LAY 時(shí)間: 2025-3-29 06:11 作者: angiography 時(shí)間: 2025-3-29 11:12
Flow of a Mixture of Reacting Perfect Gases,s a number of challenges, such as the coordination between the life cycles of the artifacts. This paper proposes an approach based on correlated transitions, i.e., transitions that belong to different life cycles and must be performed jointly. A new notation called Acta is illustrated with the help of two motivating examples.作者: CLAY 時(shí)間: 2025-3-29 14:24 作者: 鈍劍 時(shí)間: 2025-3-29 18:22
Making Collective Wisdom Wiserformation from the public, efficiently moderate the process, and identify questionable input with minimal human interaction [1-4, 7]. We will consider the logical, algorithmic, and methodological foundations for the management of large scale crowd-sourced data as well as the development of applications over such information.作者: cyanosis 時(shí)間: 2025-3-29 23:07
Revisiting the Term Frequency in Concept-Based IR Modelsh concept a . with respect to the other concepts in the same context. We explore interesting experimental results of our new weighting approach, compared to the classical approaches, through studying the retrieval performance of some classical IR models.作者: graphy 時(shí)間: 2025-3-30 01:24 作者: OFF 時(shí)間: 2025-3-30 06:19
Coordination Issues in Artifact-Centric Business Process Modelss a number of challenges, such as the coordination between the life cycles of the artifacts. This paper proposes an approach based on correlated transitions, i.e., transitions that belong to different life cycles and must be performed jointly. A new notation called Acta is illustrated with the help of two motivating examples.作者: 打火石 時(shí)間: 2025-3-30 11:50 作者: 摘要記錄 時(shí)間: 2025-3-30 15:10
Vector, Tensors, and Related Mattersnce objects in the query ordered lists. We study the performance and efficiency of our algorithms on large-scale dataset of millions of documents. Experimental results show a decrease of computational time while preserving the quality of the results.作者: 讓你明白 時(shí)間: 2025-3-30 19:00
Kolumban Hutter Ph.D.,Klaus J?hnkobal FP-tree traversal for finding Right-hand Side items. Second, . uses a modified pruning strategy. Third, . adopts a minimal coverset that is used to exclude non-minimal approximate CFDs. For these algorithms, we theoretically proved the correctness and experimentally evaluated the performances.作者: 壯觀的游行 時(shí)間: 2025-3-30 21:24 作者: 耐寒 時(shí)間: 2025-3-31 02:15 作者: 放肆的你 時(shí)間: 2025-3-31 06:53 作者: gratify 時(shí)間: 2025-3-31 10:11
,Plasticity Over 150?Years (1864–2014),System (UMLS) is used then for filtering. The filtering method aims to keep only relevant descriptors. The experiments of our approach that have been carried out on the OHSUMED collection, showed very encouraging results.作者: Extricate 時(shí)間: 2025-3-31 17:13
https://doi.org/10.1007/3-7643-7383-0uced search space of candidate matches to find complex matches. We conclude with experimental results that illustrate how the technique works. Furthermore, we show that the proposed technique greatly improves results over those obtained if the Estimate Mutual Information matrix or the Genetic Programming techniques were to be used independently.作者: enlist 時(shí)間: 2025-3-31 18:58 作者: jarring 時(shí)間: 2025-4-1 00:57
Dynamic Multi-probe LSH: An I/O Efficient Index Structure for Approximate Nearest Neighbor Searchich groups small hash buckets into a single bucket by dynamically increasing the number of hash functions during the index construction. Experimental results show that our method is significantly more I/O efficient.作者: BRIDE 時(shí)間: 2025-4-1 04:29
BioDI: A New Approach to Improve Biomedical Documents IndexingSystem (UMLS) is used then for filtering. The filtering method aims to keep only relevant descriptors. The experiments of our approach that have been carried out on the OHSUMED collection, showed very encouraging results.作者: 母豬 時(shí)間: 2025-4-1 09:25 作者: Impugn 時(shí)間: 2025-4-1 13:21
Continuum Modeling in Mechanobiologymunicated among GPUs, and achieve load balancing as well. Based on the methods, we also present algorithms on a GPU cluster. Experiments show that the single-node methods realize near-linear speedups.作者: nullify 時(shí)間: 2025-4-1 16:20
Parallel and Distributed Mining of Probabilistic Frequent Itemsets Using Multiple GPUsmunicated among GPUs, and achieve load balancing as well. Based on the methods, we also present algorithms on a GPU cluster. Experiments show that the single-node methods realize near-linear speedups.作者: CRASS 時(shí)間: 2025-4-1 20:12
Horizontal and Vertical Business Process Model Integrationon, distribution, context, etc., which all require different models. In addition, models are usually built on different levels of abstraction and the switch from one of these levels to another one may cause mismatches. Horizontal model integration refers to the creation of system models by successiv
