找回密碼
 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ī)版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-30 13:50
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
新丰县| 合作市| 崇左市| 临夏县| 罗城| 太湖县| 沧源| 宝应县| 石渠县| 永修县| 桃源县| 视频| 北流市| 虹口区| 海兴县| 河北区| 泽普县| 江油市| 三都| 孙吴县| 大洼县| 浮山县| 岳阳市| 福鼎市| 嘉定区| 中西区| 化州市| 沭阳县| 监利县| 长子县| 墨竹工卡县| 咸丰县| 垦利县| 霍州市| 故城县| 都安| 罗源县| 新沂市| 桦甸市| 金寨县| 宣汉县|