Tel-Aviv University, 1989
Course prerequisites: Algorithms
Level: Advanced, BA, BSc, and higher degrees
Each student will give a lecture
in class. Attendance in class is obligatory.
There will be a short quiz in the last lecture.
The chapter assignment will be published in http://www.cs.bgu.ac.il/~atcs131/Class_Material
Course prerequisites: Algorithms
Level: Advanced, BA, BSc, and higher degrees
I was trained in Mathematics and Computer Science, and specialized in the area of Computational Geometry. I have been working on theoretical and practical issues of computational geometry. A favorite theoretical problem is the question of Voronoi diagrams under various settings. For a certain 3D setting I got (with coauthors) the first sub-cubic algorithm. The practical aspects which involved quite a bit theory were motion planning for robots and shape matching and resemblance in computer vision. My discovery of the minimum Hausdorff-distance as a measure for robust shape matching has been widely used. In recent years I have expanded my interests to finding similarities for 3-dimensional structures. This involved comparing molecule structures for conformational polymorphs, finding similar substructures for protein structures, where my URMS method has proven highly effective. New topics I have been working on are finding patterns in predicted RNA secondary structures, flexible searching for RNA motifs (including some sequence conservation, and simple pseudoknots). For protein families I am using the consensus structure to find highly conserved segments. In computer vision I am now working on historical document analysis and pattern matching in collaboration with Dr. El-Sana and our three joint graduate students, and with Prof. Dinstein, and Prof. U. Ehrlich. The historical document analysis won some publicity lately, see our site and collaborations in ISF grant for historical documents .
o Chair of the Computer Science Department, Ben-Gurion University, 2000-2002.
o Member of Natural Sciences Faculty promotions and recruiting committee, Ben-Gurion University 2006-2008.
o Member of rector's promotions and recruiting committee , Ben-Gurion University 2008-current
o Program committee member of the Workshop on Algorithmic and
o Program committee member for Symp. On Computational geometry 2011.
1. Evolution maps for connected componenets in text documents, Ofer Biller, Klara Kedem, Itshak Dinstein and Jihad El-Sana, ICFHR 2012, pp. 405-410.
2. Occluded character restoration using active contour with shape priors, Rafi Cohen, Klara Kedem, Itshak Dinstein and Jihad El-Sana, in ICFHR 2012, pp. 497-502.
3. Finding quasi-modules of human and viral miRNAs: a case study of human cytomegalovirus (HCMV), Isana Veksler-Lublinsky, Yonat Shemer-Avni, Eti Meiri, Zvi Bentwich, Klara Kedem, Michal Ziv-Ukelson, BMC Bioinformatics 13: 322 (2012)
4. Case Study in Hebrew Character Searching, Irina Rabaev, Ofer Biller, Jihad El-Sana, Klara Kedem and Itzhak Dinstein, International Conference on Document Analysis and Recognition, (ICDAR 2011 ), pp. 1080 -1084.
5. User-Assisted Alignment of Arabic Historical Manuscripts, Abed Asi, Irina Rabaev, Klara Kedem and Jihad El-Sana, International Workshop on Historical Document Imaging and Processing (HIP’2011), pp. 22 - 28.
6. A Library of Protein Surface Patches Discriminates between Native Structures and Decoys Generated by Structure Prediction Servers,
Roi Gamliel, Klara
7. Gene bi-targeting by viral and human miRNAs, Isana Veksler-Lublinsky, Yonat Shemer-Avni, Klara kedem, Michal Ziv-Ukelson, BMC Bioinformatics, 11:249 (2010)
8. Approximate input sensitive algorithms for point pattern matching, Dror Aiger, Klara Kedem, Pattern Recognition: 43(1): 153-159 (2010).
9. Adaptive shape prior for recognition and variational segmentation of degraded historical characters. Itay Bar Yosef, Alik Mokeichev, Klara Kedem, Itshak Dinstein. Pattern Recognition, Vol 42, pp. 3348-3354, 2009.
10. Text line segmentation for degraded handwritten historical documents. Itay Bar Yosef, Nate hagbi, Klara Kedem, Itshak Dinstein. The 10th International Conference on Document Analysis and Recognition (ICDAR) 2009, pp. 1161-1165.
11. A new library of surface patches - design and applications. Roi Gamliel, Klara Kedem, Rachel Kolodny & Chen Keasar. Technical Report 09-10, Computer Science Department, BGU, October 2009.
12. Geometric Pattern Matching for point sets in the plane under similarity transformations, Dror Aiger, Klara Kedem, Information Processing Letters: 109(16): 935-940 (2009).
13. A GPU based algorithm for approximately finding the largest common point set in the plane under similarity transformation, Dror Aiger, Klara Kedem International Journal of Image and Graphics: 9(2) 287–298, 2009.
14. FASH : A web application for nucleotides sequence search, I. Veksler-lublinsky, D. Barash, C. Avisar, E. Troim, L.P. Chew, and K. Kedem, Source Code for Biology and Medicine 2008, 3(9).
15. Computational Identification of Three-Way Junctions in Folded RNAs: A Case Study in Arabidopsis, A. Cohen, S. Bocobza, I. Veksler, I. Gabdank, K. Kedem, M. Shapira, A. Aharoni, E. Nudler, D. Barash , In Silico Biology, 2008, 8:0010.
16. In-Place Augmented Reality, N. Hagbi, O. Bergig, J. El-Sana, K. Kedem, M. Billinghurst, 7th IEEE International Symposium on Mixed and Augmented Reality, Cambridge, UK, (2008), pp: 135-138.
17. Global and Local Shape Prior for Variational Segmentation of Degraded Historical Characters, I. Bar-Yosef, A. Mokeichev, K. Kedem, U. Ehrlich, and I. Dinstein, 11th International Conference on Frontiers in Handwriting Recognition (ICFHR), Canada, (2008), pp.198-203.
18. Fast and Accurate Skew Estimation Based on Distance Transform, I. Bar-Yosef, N. Hagbi, K. Kedem, and I. Dinstein, The 8th International Workshop on Document Analysis Systems (DAS), Nara, Japan, (2008), pp. 402-407.
19. Applying graphics hardware to achieve extremely fast geometric pattern matching in two and three dimensional transformation space, D. Aiger and K. Kedem, , Information Processing Letters 105(6)(2008), pp. 224-230.
20. Exact and approximate
geometric pattern matching for point sets in the plane under similarity
transformations, D. Aiger and K.
Kedem, CCCG (2007),
Structure Based Flexible Search Method for NcRNA
22. Binarization, character extraction, and writer identification of historical Hebrew calligraphy documents, I. Bar-Yosef, I. Beckman, I. Dinstein and K. Kedem, International Journal on Document Analysis and Recognition, 9(2007), pp. 89-99.
23. Integration of RNA search methods for identifying novel riboswitch patterns in eukaryotes, A.N. Cohen, K. Kedem, M. Shapira and D. Barash, Computational Systems Bioinformatics Conference, IEEE, (2005), pp. 193-194
24. The URMS-RMS hybrid algorithm for fast and sensitive local protein structure alignment, G. Yona and K. Kedem, Journal of Computational Biology 12(2005), pp. 12-32.
25. Classification of Hebrew calligraphic handwriting styles: preliminary results, I. Bar-Yosef, K. Kedem, I. Dinstein, M. Beit-Arie and E. Angel, proc. International Workshop on Document Image Analysis for Libraries, (2004), pp. 299-305, Palo Alto Research Center (PARC), CA, USA.
26. STR2: a structure to string approach for locating G-box riboswitch shapes in pre-selected genes, O. Bergig, D. Barash, E. Nudler and K. Kedem, In Silico Biol. 4, 0049 (2004).
27. Voronoi diagrams of moving points in the plane and of lines in space: tight bounds for simple configurations, A. Weisman, L.P. Chew and K. Kedem, Information Processing Letters, 92(2004), pp. 245-251.
28. Finding the consensus shape for a protein family, L.P. Chew and K. Kedem, Algorithmica, 38(1)(2004), pp. 115-129.
29. Walking Around Fat Obstacles, L.P. Chew, H. David, M.J. Katz and K. Kedem, Information Processing Letters, 83(2002), pp. 135-140.
30. Improved algorithms for placing undesirable facilities, M.J. Katz, K. Kedem and M. Segal, Computers and Operations Research, 29(13)(2002), pp. 1859-1872.
31. Determining the Largest Common Connected Substructure In Conformational Polymorphs, A. Enosh, K. Kedem and J. Bernstein, ESA (2002), Lecture Notes on Computer Science #2461, pp. 436-448.
32. Optimal facility location under various distance functions, S. Bespametnik, K. Kedem, M. Segal and A. Tamir, International Journal of Computational Geometry and Applications, 10(5)(2000), pp. 523-534.
33. Comparative analysis of dendritic architecture of identified neurons using the Hausdorff distance metric, A. Mizrahi, E. Ben-Ner, G.J. Glusman,M. Katz, K. Kedem and F. Libersat, Journal of Comparative Neurology, 422(3)(2000), pp. 415-428.
34. Discrete Rectilinear 2-Center Problems, M. Katz, K. Kedem and M. Segal, Computational Geometry: Theory and Applications, 15(2000), pp. 203-214.
35. Fast detection of geometric substructure in proteins, L.P. Chew, K. Kedem, D.P. Huttenlocher and J. Kleinberg, Journal of Computational Biology, 6:(3-4)(1999), pp. 313-325.
36. Unit-vector RMS (URMS) as a tool to analyze molecular dynamics trajectories, K. Kedem, L.P. Chew and R. Elber, Proteins: Structure, Function and Genetics, 37(1999), pp. 554-564.
37. Computing a double-ray center for a planar point set, A. Glozman, K. Kedem and G. Shpitalnik, International Journal of Computational Geometry and Applications, 9(2)1999, pp. 103-123.
38. Geometric Pattern Matching in d-Dimensional Space, L.P. Chew, D. Dor, A. Efrat and K. Kedem, Discrete and Computational Geometry, 21(1999), pp. 257-274.
Please see our web site Historical documents' analysis in Hebrew and Arabic in the media