Relational queries computable in polynomial time
- 作者Neil Immerman
- 卷第68卷
- 印刷ISSN0019-9958
- 文件大小859.36KB
- 发表时间1986
- DOI10.1016/s0019-9958(86)80029-8
- 页码86-104
Maintaining order in a generalized linked listAthanasios K. Tsakalidis · 1984
Efficient automatic discovery of ‘hot’ itemsetsIoannis N. Kouris; Christos H. Makris; Athanasios K. Tsakalidis · 2004
The nearest common ancestor in a dynamic treeAthanasios K. Tsakalidis · 1988
Using Information Retrieval techniques for supporting data miningIoannis N. Kouris; Christos H. Makris; Athanasios K. Tsakalidis · 2005
Computational Approaches for the Prediction of Protein-Protein Interactions: A SurveyA. Theofilatos, Konstantinos; M. Dimitrakopoulos, Christos; K. Tsakalidis, Athanasios; D. Likothanassis, Spyridon; T. Papadimitriou, Stergios; P. Mavroudi, Seferina · Current Bioinformatics · 2011
[ACM Press the 4th International Conference - Thessaloniki, Greece (2014.06.02-2014.06.04)] Proceedings of the 4th International Conference on Web Intelligence, Mining and Semantics (WIMS14) - WIMS '14 - Knowledge Sanitization on the WebKagklis, Vasileios; Verykios, Vassilios S.; Tzimas, Giannis; Tsakalidis, Athanasios K. · 2014
[IEEE 2014 IEEE 26th International Conference on Tools with Artificial Intelligence (ICTAI) - Limassol, Cyprus (2014.11.10-2014.11.12)] 2014 IEEE 26th International Conference on Tools with Artificial Intelligence - An Integer Linear Programming Scheme to Sanitize Sensitive Frequent ItemsetsKagklis, Vasileios; Verykios, Vassilios S.; Tzimas, Giannis; Tsakalidis, Athanasios K. · 2014