找回密碼
 To register

QQ登錄

只需一步,快速開始

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

打印 上一主題 下一主題

Titlebook: Database and Expert Systems Applications; 24th International C Hendrik Decker,Lenka Lhotská,A Min Tjoa Conference proceedings 2013 Springer

[復制鏈接]
樓主: 使沮喪
31#
發(fā)表于 2025-3-26 22:27:59 | 只看該作者
32#
發(fā)表于 2025-3-27 04:28:36 | 只看該作者
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
33#
發(fā)表于 2025-3-27 06:40:51 | 只看該作者
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
34#
發(fā)表于 2025-3-27 09:43:30 | 只看該作者
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
35#
發(fā)表于 2025-3-27 16:37:42 | 只看該作者
36#
發(fā)表于 2025-3-27 18:29:37 | 只看該作者
37#
發(fā)表于 2025-3-28 01:24:15 | 只看該作者
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
38#
發(fā)表于 2025-3-28 03:13:45 | 只看該作者
39#
發(fā)表于 2025-3-28 07:46:32 | 只看該作者
40#
發(fā)表于 2025-3-28 11:28:11 | 只看該作者
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.
 關于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學 Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經(jīng)驗總結 SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學 Yale Uni. Stanford Uni.
QQ|Archiver|手機版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2026-1-25 06:54
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權所有 All rights reserved
快速回復 返回頂部 返回列表
阿图什市| 博罗县| 夏津县| 延庆县| 白银市| 明光市| 大安市| 濮阳市| 防城港市| 阳信县| 平阴县| 兴海县| 临沂市| 田东县| 玛纳斯县| 广州市| 沅陵县| 林周县| 石首市| 长兴县| 民和| 天等县| 灵璧县| 西华县| 增城市| 漳浦县| 鄱阳县| 上虞市| 德州市| 紫阳县| 定日县| 蕉岭县| 宁海县| 瑞安市| 石楼县| 凤庆县| 宣武区| 临邑县| 彭水| 葫芦岛市| 高台县|