IEEE Transactions on Knowledge and Data Engineering

Công bố khoa học tiêu biểu

* Dữ liệu chỉ mang tính chất tham khảo

Sắp xếp:  
Graph Regularized Feature Selection with Data Reconstruction
IEEE Transactions on Knowledge and Data Engineering - Tập 28 Số 3 - Trang 689-700 - 2016
Zhou Zhao, Xiaofei He, Deng Cai, Lijun Zhang, Wilfred Ng, Yueting Zhuang
An efficient Split-Merge re-start for the K-means algorithm
IEEE Transactions on Knowledge and Data Engineering - - Trang 1-1 - 2020
Marco Capó, Aritz Pérez, Jose A. Antonio Lozano
A Sketch Framework for Approximate Data Stream Processing in Sliding Windows
IEEE Transactions on Knowledge and Data Engineering - - Trang 1-1 - 2022
Xiangyang Gou, Yinda Zhang, Zhoujing Hu, Long He, Ke Wang, Xilai Liu, Tong Yang, Yi Wang, Bin Cui
Analyzing and Managing Role-Based Access Control Policies
IEEE Transactions on Knowledge and Data Engineering - Tập 20 Số 7 - Trang 924-939 - 2008
Karsten Sohr, Michael Drouineaud, Gail-Joon Ahn, Martin Gogolla
Today more and more security-relevant data is stored on computer systems; security-critical business processes are mapped to their digital counterparts. This situation applies to various domains such as health care industry, digital government, and financial service institutes requiring that different security requirements must be fulfilled. Authorisation constraints can help the policy architect ...... hiện toàn bộ
#Access controls #Protection mechanisms #Access controls #Protection mechanisms
Locality Reconstruction Models for Book Representation
IEEE Transactions on Knowledge and Data Engineering - Tập 30 Số 10 - Trang 1873-1886 - 2018
Haijun Zhang, Shuang Wang, Mingbo Zhao, Xiaofei Xu, Yunming Ye
An efficient path computation model for hierarchically structured topographical road maps
IEEE Transactions on Knowledge and Data Engineering - Tập 14 Số 5 - Trang 1029-1046 - 2002
Sungwon Jung, S. Pramanik
In this paper, we have developed a HiTi (Hierarchical MulTi) graph model for structuring large topographical road maps to speed up the minimum cost route computation. The HiTi graph model provides a novel approach to abstracting and structuring a topographical road map in a hierarchical fashion. We propose a new shortest path algorithm named SPAH, which utilizes HiTi graph model of a topographical...... hiện toàn bộ
#Computational modeling #Roads #Navigation #Computational efficiency #Performance analysis #Shortest path problem #Concurrent computing #Cost function #Automobiles #Space exploration
HAL: a faster match algorithm
IEEE Transactions on Knowledge and Data Engineering - Tập 14 Số 5 - Trang 1047-1058 - 2002
Pou-Yung Lee, A.M.K. Cheng
Existing match algorithms treat the matching process like the querying process of relational databases. Owing to the combinatorial nature of the matching process, the match time greatly varies in different recognize-act cycles. Current match algorithms utilize local matching support networks with redundant working memory elements shared among rules involving the same classes. Since the match time ...... hiện toàn bộ
#Production systems #Expert systems #Relational databases #Heuristic algorithms #Performance analysis #Algorithm design and analysis #Knowledge based systems #Database systems #Explosions #Inference algorithms
A Contemporary and Comprehensive Survey on Streaming Tensor Decomposition
IEEE Transactions on Knowledge and Data Engineering - Tập 35 Số 11 - Trang 10897-10921 - 2023
Le Trung Thanh, Karim Abed-Meraim, Nguyen Linh Trung, Adel Hafiane
Tensor decomposition has been demonstrated to be successful in a wide range of applications, from neuroscience and wireless communications to social networks. In an online setting, factorizing tensors derived from multidimensional data streams is however nontrivial due to several inherent problems of real-time stream processing. In recent years, many research efforts have been dedicated to develop...... hiện toàn bộ
#BTD #CP #data stream #low-rank tensor approximation #online optimization #tensor decomposition #tensor-train #t-SVD #tucker
Scheduling transactions with temporal constraints: exploiting data semantics
IEEE Transactions on Knowledge and Data Engineering - Tập 14 Số 5 - Trang 1155-1166 - 2002
Ming Xiong, K. Ramamritham, J.A. Stankovic, D. Towsley, R. Sivasankaran
In this paper, issues involved in the design of a real-time database which maintains data temporal consistency are discussed. The concept of data-deadline is introduced and time cognizant transaction scheduling policies are proposed. Informally, data-deadline is a deadline assigned to a transaction due to the temporal constraints of the data accessed by the transaction. Further, two time cognizant...... hiện toàn bộ
#Time factors #Database systems #Transaction databases #Real time systems #Protocols #Scheduling #Delay effects #Process design #Robot sensing systems #Navigation
The presumed-either two-phase commit protocol
IEEE Transactions on Knowledge and Data Engineering - Tập 14 Số 5 - Trang 1190-1196 - 2002
G.K. Attaluri, K. Salem
This paper describes the presumed-either two-phase commit protocol. Presumed-either exploits log piggybacking to reduce the cost of committing transactions. If timely piggybacking occurs, presumed-either combines the performance advantages of presumed-abort and presumed-commit. Otherwise, presumed-either behaves much like the widely-used presumed-abort protocol.
#Protocols #Tail #Peer to peer computing #Costs #Resource management #Database systems #Data structures
Tổng số: 36   
  • 1
  • 2
  • 3
  • 4