找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

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

[复制链接]
楼主: 小费
发表于 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
发表于 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
发表于 2025-3-29 01:50:19 | 显示全部楼层
发表于 2025-3-29 04:01:23 | 显示全部楼层
发表于 2025-3-29 07:51:43 | 显示全部楼层
发表于 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
发表于 2025-3-29 16:57:49 | 显示全部楼层
发表于 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
发表于 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
发表于 2025-3-30 04:47:56 | 显示全部楼层
Database and Expert Systems Applications978-3-030-27618-8Series ISSN 0302-9743 Series E-ISSN 1611-3349
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-8 22:26
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表