找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

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

[复制链接]
楼主: 使沮丧
发表于 2025-3-26 22:27:59 | 显示全部楼层
发表于 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
发表于 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
发表于 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
发表于 2025-3-27 16:37:42 | 显示全部楼层
发表于 2025-3-27 18:29:37 | 显示全部楼层
发表于 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
发表于 2025-3-28 03:13:45 | 显示全部楼层
发表于 2025-3-28 07:46:32 | 显示全部楼层
发表于 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.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-18 06:39
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表