找回密碼
 To register

QQ登錄

只需一步,快速開始

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

打印 上一主題 下一主題

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

[復(fù)制鏈接]
51#
發(fā)表于 2025-3-30 12:02:42 | 只看該作者
52#
發(fā)表于 2025-3-30 14:43:27 | 只看該作者
Hepatotoxicity of Oral Contraceptivesociations rules can be either exact or approximate. We also illustrate the efficiency of our approach over several data sets and we prove that .-based classification rules have very encouraging results.
53#
發(fā)表于 2025-3-30 18:23:54 | 只看該作者
Contract Theory in Continuous-Time Modelslational databases, based on similar techniques previously proposed for conventional XML documents. Also, we present a new ordered-based approach on representing context in such a way so as to facilitate the formulation of context-aware queries, and we show how we can manipulate context.
54#
發(fā)表于 2025-3-30 22:08:36 | 只看該作者
55#
發(fā)表于 2025-3-31 03:38:02 | 只看該作者
Genetic Programming with Greedy Search for Web Service Compositiontal evaluation has been carried out using public benchmark test cases with repositories of up to 15,000 web services and 31,000 properties. The results show good performance in searching for best service compositions, where the number of atomic web services used and the tree depth are used as objectives for minimization.
56#
發(fā)表于 2025-3-31 08:59:59 | 只看該作者
Inferring Knowledge from Concise Representations of Both Frequent and Rare Jaccard Itemsetsociations rules can be either exact or approximate. We also illustrate the efficiency of our approach over several data sets and we prove that .-based classification rules have very encouraging results.
57#
發(fā)表于 2025-3-31 11:29:51 | 只看該作者
58#
發(fā)表于 2025-3-31 17:10:51 | 只看該作者
59#
發(fā)表于 2025-3-31 20:48:08 | 只看該作者
Evaluating the Interest of Revamping Past Search Resultsaw are applied to construct simulated document collections suitable for information retrieval evaluation. Experiments comparing a traditional retrieval approach with our approach based on past queries using past queries show encouraging improvements using our approach.
60#
發(fā)表于 2025-3-31 23:45:12 | 只看該作者
Efficient Time Aggregation and Querying of Flashed Streams in Constrained Motesams, we discuss the approach and study how to optimize group-by aggregation over time-ordered data in that context, and to provide simple all-purpose group-by and join algorithms. We used an experimental testbed to evaluate the findings and prove the advantage of the alternatives and studies that we made.
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(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-29 21:51
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
保山市| 乐清市| 定西市| 龙泉市| 佳木斯市| 鲜城| 云阳县| 莱西市| 谷城县| 乌兰浩特市| 贡山| 桂东县| 板桥市| 龙南县| 阿坝| 安义县| 剑阁县| 独山县| 台南县| 东台市| 循化| 绥德县| 建瓯市| 黎川县| 城市| 安丘市| 乌鲁木齐市| 东宁县| 民县| 柳江县| 南陵县| 深州市| 呼伦贝尔市| 昭觉县| 子洲县| 江达县| 长垣县| 翁源县| 鹰潭市| 施甸县| 醴陵市|