Unit 01 Sets, Relations and Functions Eng
Jinru He, Junyuan Zeng, and Torsten Suel Computer Science & Engineering Polytechnic Institute of NYU Improved Index Compression Techniques for Versioned.
Perfect Matching for Biconnected Cubic Graphs in O(nlog 2 n) Time Krzysztof Diks & Piotr Stańczyk.
1 Weighted Bipartite Matching Lecture 4: Jan 18. 2 Weighted Bipartite Matching Given a weighted bipartite graph, find a matching with maximum total weight.
Linear Algebra by Nayak
1Evimaria Terzi7/14/2015 Towards identity-anonymization on graphs K. Liu & E. Terzi, SIGMOD 2008 A framework for computing the privacy score of users in.
Learning DFA from corrections Leonor Becerra-Bonache, Cristina Bibire, Adrian Horia Dediu Research Group on Mathematical Linguistics, Rovira i Virgili.
Descendent Subtrees Comparison of Phylogenetic Trees with Applications to Co-evolutionary Classifications in Bacterial Genome Yaw-Ling Lin 1 Tsan-Sheng.
Updating ABoxes in DL-Lite D. Calvanese, E. Kharlamov, W. Nutt, D. Zheleznyakov Free University of Bozen-Bolzano AMW 2010, May 2010.
Inferring Finite Automata from queries and counter-examples
Learning DFA from corrections
New Approaches to DFA learning
