找回密碼
 To register

QQ登錄

只需一步,快速開(kāi)始

掃一掃,訪問(wèn)微社區(qū)

打印 上一主題 下一主題

Titlebook: Database and Expert Systems Applications; 30th International C Sven Hartmann,Josef Küng,Ismail Khalil Conference proceedings 2019 Springer

[復(fù)制鏈接]
樓主: 小費(fèi)
41#
發(fā)表于 2025-3-28 15:48:36 | 只看該作者
Succinct BWT-Based Sequence Predictionams. Sequence prediction is a popular task, which consists of predicting the next symbol of a sequence, given a set of training sequences. Although numerous prediction models have been proposed, many have a low accuracy because they are lossy models (they discard information from training sequences
42#
發(fā)表于 2025-3-28 19:19:09 | 只看該作者
TRR: Reducing Crowdsourcing Task Redundancyd to accomplish a crowdsourcing task. Typical task assignment systems assign tasks to a fixed number of crowd workers, while tasks are varied in difficulty as being easy or hard tasks. Easy tasks need fewer task assignments than hard tasks. We present TRR, a task redundancy reducer that assigns task
43#
發(fā)表于 2025-3-29 01:50:19 | 只看該作者
44#
發(fā)表于 2025-3-29 04:01:23 | 只看該作者
45#
發(fā)表于 2025-3-29 07:51:43 | 只看該作者
46#
發(fā)表于 2025-3-29 13:02:44 | 只看該作者
Querying in a Workload-Aware Triplestore Based on NoSQL DatabasesL querying has been the main issue for virtually all the recent RDF triplestores. This paper presents ., a middleware that addresses workload-adaptive management of large RDF graphs. Our middleware not only employs all the most used NoSQL data models but also provides a novel RDF data partitioning a
47#
發(fā)表于 2025-3-29 16:57:49 | 只看該作者
48#
發(fā)表于 2025-3-29 20:02:46 | 只看該作者
PFed: Recommending Plausible Federated SPARQL Querieswing number of datasets is challenging. In this paper, we propose ., an approach to recommend plausible federated queries based on real query logs of different datasets. The problem is not to find similar federated queries, but plausible complementary queries over different datasets. Starting with a
49#
發(fā)表于 2025-3-30 00:13:15 | 只看該作者
Representing and Reasoning About Precise and Imprecise Time Points and Intervals in Semantic Web: De number of approaches exist. However, they handle only precise temporal data and lack imprecise ones. In this paper, we propose a crisp-based approach for representing and reasoning about temporal data in term of quantitative (i.e., time points that can be dates and clocks, and time intervals) as we
50#
發(fā)表于 2025-3-30 04:47:56 | 只看該作者
Database and Expert Systems Applications978-3-030-27618-8Series ISSN 0302-9743 Series E-ISSN 1611-3349
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛(ài)論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評(píng) 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-13 13:57
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
石泉县| 台湾省| 楚雄市| 永春县| 工布江达县| 武清区| 会同县| 商河县| 亳州市| 玉山县| 扎兰屯市| 巍山| 宜州市| 海兴县| 上林县| 海晏县| 新蔡县| 沙田区| 从化市| 锡林郭勒盟| 哈密市| 娄底市| 普宁市| 霍林郭勒市| 海伦市| 会理县| 荃湾区| 深水埗区| 阳信县| 嵩明县| 桃园市| 新邵县| 西贡区| 元谋县| 娱乐| 望奎县| 怀柔区| 正阳县| 黄浦区| 阳信县| 保德县|