伪造者
发表于 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
adroit
发表于 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
http://reply.papertrans.cn/27/2635/263468/263468_43.png
evasive
发表于 2025-3-29 04:01:23
http://reply.papertrans.cn/27/2635/263468/263468_44.png
Feature
发表于 2025-3-29 07:51:43
http://reply.papertrans.cn/27/2635/263468/263468_45.png
恭维
发表于 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
constitute
发表于 2025-3-29 16:57:49
http://reply.papertrans.cn/27/2635/263468/263468_47.png
Vo2-Max
发表于 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
FELON
发表于 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
diathermy
发表于 2025-3-30 04:47:56
Database and Expert Systems Applications978-3-030-27618-8Series ISSN 0302-9743 Series E-ISSN 1611-3349