压倒性胜利 发表于 2025-3-28 17:36:32
Performance Evaluation of a DOM-Based XML Database: Storage, Indexing, and Query Optimization of joins by shortening the path and path-complementing is a technique to use a different RPE to substitute the path specified in a user query. Experimental results show that the proposed algorithms are quite efficient.catagen 发表于 2025-3-28 19:31:06
http://reply.papertrans.cn/16/1502/150179/150179_42.png秘传 发表于 2025-3-29 02:03:08
Using PR-Tree and HPIR to Manage Coherence of Semantic Cache for Location Dependent Data in Mobile DPR-tree and HPIR based algorithm, which can significantly reduce the unnecessary uplink requests and downlink broadcasts compared to previous PIR based schemes. Simulation experiments are carried out to evaluate the proposed strategy.轻浮思想 发表于 2025-3-29 04:55:19
http://reply.papertrans.cn/16/1502/150179/150179_44.png词汇记忆方法 发表于 2025-3-29 08:47:00
http://reply.papertrans.cn/16/1502/150179/150179_45.pngDefault 发表于 2025-3-29 13:06:07
Team Work Oriented Flexible Workflow Management Systemhe executing method based on rewriting mechanism for person allocation policy is provided and the producing mechanism of work transactions is discussed. At the end of the paper, the architecture of a flexible workflow management system supporting team work is given out.教育学 发表于 2025-3-29 17:17:50
http://reply.papertrans.cn/16/1502/150179/150179_47.png冰雹 发表于 2025-3-29 19:53:53
Mining Predicate Association Rule by Gene Expression Programmingne decoding procedure always success for any well-defined gene. (4) Extensive experiments are given to demonstrate that PAGEP can discover some association rule that cannot be expressed and discovered by traditional method.哑剧 发表于 2025-3-30 03:15:52
An Empirical Study of Learning-Based Web Searche learning results. The experimental results are presented, together with analysis for the relationships between user behavior and system performance, which are important for further improvement on learning-based Web search technology.lymphoma 发表于 2025-3-30 06:15:54
Extract Frequent Pattern from Simple Graph Dataple graphs efficiently, have been proposed. We evaluate the performance of the algorithm by experiments with synthetic datasets. The empirical results show that the SFP can do the job well. At the end of this paper, the potential improvement of SFP is mentioned.