| 2012 | ||
|---|---|---|
| j40 | Isana Veksler-Lublinsky, Yonat Shemer-Avni, Eti Meiri, Zvi Bentwich, Klara Kedem, Michal Ziv-Ukelson: Finding quasi-modules of human and viral miRNAs: a case study of human cytomegalovirus (HCMV). BMC Bioinformatics 13: 322 (2012) | |
| c37 | Ofer Biller, Klara Kedem, Its'hak Dinstein, Jihad El-Sana: Evolution Maps for Connected Components in Text Documents. ICFHR 2012: 405-410 | |
| c36 | Rafi Cohen, Klara Kedem, Its'hak Dinstein, Jihad El-Sana: Occluded Character Restoration Using Active Contour with Shape Priors. ICFHR 2012: 497-502 | |
| 2011 | ||
| j39 | Oriel Bergig, Nate Hagbi, Jihad El-Sana, Klara Kedem, Mark Billinghurst: In-Place Augmented Reality. Virtual Reality 15(2-3): 201-212 (2011) | |
| c35 | Irina Rabaev, Ofer Biller, Jihad El-Sana, Klara Kedem, Its'hak Dinstein: Case Study in Hebrew Character Searching. ICDAR 2011: 1080-1084 | |
| 2010 | ||
| j38 | Isana Veksler-Lublinsky, Yonat Shemer-Avni, Klara Kedem, Michal Ziv-Ukelson: Gene bi-targeting by viral and human miRNAs. BMC Bioinformatics 11: 249 (2010) | |
| j37 | Dror Aiger, Klara Kedem: Approximate input sensitive algorithms for point pattern matching. Pattern Recognition 43(1): 153-159 (2010) | |
| 2009 | ||
| j36 | Dror Aiger, Klara Kedem: A GPU-Based Algorithm for Approximately Finding the Largest Common Point Set in the Plane under Similarity Transformation. Int. J. Image Graphics 9(2): 287-298 (2009) | |
| j35 | Dror Aiger, Klara Kedem: Geometric pattern matching for point sets in the plane under similarity transformations. Inf. Process. Lett. 109(16): 935-940 (2009) | |
| j34 | Itay Bar Yosef, Alik Mokeichev, Klara Kedem, Its'hak Dinstein, Uri Ehrlich: Adaptive shape prior for recognition and variational segmentation of degraded historical characters. Pattern Recognition 42(12): 3348-3354 (2009) | |
| c34 | Itay Bar Yosef, Nate Hagbi, Klara Kedem, Its'hak Dinstein: Line Segmentation for Degraded Handwritten Historical Documents. ICDAR 2009: 1161-1165 | |
| 2008 | ||
| j33 | Dror Aiger, Klara Kedem: Applying graphics hardware to achieve extremely fast geometric pattern matching in two and three dimensional transformation space. Inf. Process. Lett. 105(6): 224-230 (2008) | |
| j32 | Isana Veksler-Lublinsky, Danny Barash, Chai Avisar, Einav Troim, L. Paul Chew, Klara Kedem: FASH: A web application for nucleotides sequence search. Source Code for Biology and Medicine 3 (2008) | |
| c33 | Itay Bar Yosef, Nate Hagbi, Klara Kedem, Its'hak Dinstein: Fast and Accurate Skew Estimation Based on Distance Transform. Document Analysis Systems 2008: 402-407 | |
| c32 | Nate Hagbi, Oriel Bergig, Jihad El-Sana, Klara Kedem, Mark Billinghurst: In-place Augmented Reality. ISMAR 2008: 135-138 | |
| 2007 | ||
| j31 | Itay Bar Yosef, Isaac Beckman, Klara Kedem, Its'hak Dinstein: Binarization, character extraction, and writer identification of historical Hebrew calligraphy documents. IJDAR 9(2-4): 89-99 (2007) | |
| j30 | Isana Veksler-Lublinsky, Michal Ziv-Ukelson, Danny Barash, Klara Kedem: A Structure-Based Flexible Search Method for Motifs in RNA. Journal of Computational Biology 14(7): 908-926 (2007) | |
| c31 | Dror Aiger, Klara Kedem: Exact and Approximate Geometric Pattern Matching for Point Sets in the Plane under Similarity Transformations. CCCG 2007: 181-184 | |
| 2005 | ||
| j29 | Golan Yona, Klara Kedem: The URMS-RMS Hybrid Algorithm for Fast and Sensitive Local Protein Structure Alignment. Journal of Computational Biology 12(1): 12-32 (2005) | |
| c30 | Adaya N. Cohen, Klara Kedem, Michal Shapira, Danny Barash: Integration of RNA Search methods for Identifying Novel Riboswitch Patterns in Eukaryotes. CSB Workshops 2005: 193-195 | |
| c29 | Itay Bar Yosef, Isaac Beckman, Klara Kedem, Its'hak Dinstein: Extraction of Specified Objects from Binary Images Using Object Based Erosion Transform: Application to Hebrew Calligraphic Manuscripts. ICDAR 2005: 878-882 | |
| 2004 | ||
| j28 | Amit Weisman, L. Paul Chew, Klara Kedem: Voronoi diagrams of moving points in the plane and of lines in space: tight bounds for simple configurations. Inf. Process. Lett. 92(5): 245-251 (2004) | |
| j27 | Oriel Bergig, Danny Barash, Evgeny Nudler, Klara Kedem: STR2: A structure to string approach for locating G-box riboswitch shapes in pre-selected genes. In Silico Biology 4 (2004) | |
| c28 | Oriel Bergig, Danny Barash, Klara Kedem: RNA Motif Search Using the Structure to String (STR2) Method. CSB 2004: 660-661 | |
| c27 | Itay Bar Yosef, Klara Kedem, Its'hak Dinstein, Malachi Beit-Arie, Edna Engel: Classification of Hebrew Calligraphic Handwriting Styles: Preliminary Results. DIAL 2004: 299-305 | |
| 2003 | ||
| j26 | L. Paul Chew, Klara Kedem: Finding the Consensus Shape for a Protein Family. Algorithmica 38(1): 115-129 (2003) | |
| 2002 | ||
| j25 | Matthew J. Katz, Klara Kedem: Sixteenth European Workshop on Computational Geometry - Editorial. Comput. Geom. 21(1-2): 1 (2002) | |
| j24 | Matthew J. Katz, Klara Kedem, Michael Segal: Improved algorithms for placing undesirable facilities. Computers & OR 29(13): 1859-1872 (2002) | |
| j23 | L. Paul Chew, Haggai David, Matthew J. Katz, Klara Kedem: Walking around fat obstacles. Inf. Process. Lett. 83(3): 135-140 (2002) | |
| c26 | L. Paul Chew, Klara Kedem: Finding the consensus shape for a protein family. Symposium on Computational Geometry 2002: 64-73 | |
| c25 | Angela Enosh, Klara Kedem, Joel Bernstein: Determining Similarity of Conformational Polymorphs. ESA 2002: 436-448 | |
| 2000 | ||
| j22 | Matthew J. Katz, Klara Kedem, Michael Segal: Discrete rectilinear 2-center problems. Comput. Geom. 15(4): 203-214 (2000) | |
| j21 | Sergei Bespamyatnikh, Klara Kedem, Michael Segal, Arie Tamir: Optimal Facility Location Under Various Distance Functions. Int. J. Comput. Geometry Appl. 10(5): 523-534 (2000) | |
| 1999 | ||
| j20 | L. Paul Chew, Dorit Dor, Alon Efrat, Klara Kedem: Geometric Pattern Matching in d -Dimensional Space. Discrete & Computational Geometry 21(2): 257-274 (1999) | |
| j19 | Alex Glozman, Klara Kedem, Gregory Shpitalnik: Computing a double-ray center for a planar point set. Int. J. Comput. Geometry Appl. 9(2): 109-123 (1999) | |
| j18 | L. Paul Chew, Daniel P. Huttenlocher, Klara Kedem, Jon M. Kleinberg: Fast Detection of Common Geometric Substructure in Proteins. Journal of Computational Biology 6(3/4): 313-325 (1999) | |
| c24 | Matthew J. Katz, Klara Kedem, Michael Segal: Improved algorithms for placing undesirable facilities. CCCG 1999 | |
| c23 | L. Paul Chew, Daniel P. Huttenlocher, Klara Kedem, Jon M. Kleinberg: Fast detection of common geometric substructure in proteins. RECOMB 1999: 104-114 | |
| c22 | Sergei Bespamyatnikh, Klara Kedem, Michael Segal: Optimal Facility Location under Various Distance Functions. WADS 1999: 318-329 | |
| 1998 | ||
| j17 | L. Paul Chew, Klara Kedem: Getting around a lower bound for the minimum Hausdorff distance. Comput. Geom. 10(3): 197-202 (1998) | |
| j16 | Alex Glozman, Klara Kedem, Gregory Shpitalnik: On some geometric selection and optimization problems via sorted matrices. Comput. Geom. 11(1): 17-28 (1998) | |
| j15 | ||
| j14 | Michael Segal, Klara Kedem: Enclosing k Points in the Smallest Axis Parallel Rectangle. Inf. Process. Lett. 65(2): 95-99 (1998) | |
| j13 | L. Paul Chew, Klara Kedem, Micha Sharir, Boaz Tagansky, Emo Welzl: Voronoi Diagrams of Lines in 3-Space Under Polyhedral Convex Distance Functions. J. Algorithms 29(2): 238-255 (1998) | |
| c21 | ||
| 1997 | ||
| j12 | L. Paul Chew, Michael T. Goodrich, Daniel P. Huttenlocher, Klara Kedem, Jon M. Kleinberg, Dina Kravets: Geometric Pattern Matching Under Euclidean Motion. Comput. Geom. 7: 113-124 (1997) | |
| j11 | Klara Kedem, Micha Sharir, Sivan Toledo: On Critical Orientations in the Kedem-Sharir Motion Planning Algorithm. Discrete & Computational Geometry 17(2): 227-239 (1997) | |
| j10 | Klara Kedem, Daniel Cohen-Or: Efficient Bitmap Resemblance Under Translations. Int. J. Comput. Geometry Appl. 7(1/2): 57-84 (1997) | |
| c20 | ||
| 1996 | ||
| j9 | Olivier Devillers, Mordecai J. Golin, Klara Kedem, Stefan Schirra: Queries on Voronoi Diagrams of Moving Points. Comput. Geom. 6: 315-327 (1996) | |
| c19 | Michael Segal, Klara Kedem: Enclosing K Points in the Smallest Axis Parallel Rectangle. CCCG 1996: 20-25 | |
| c18 | Klara Kedem, Yana Yarmovski: Curve Based Stereo Matching Using the Minimum Hausdorff Distance. Symposium on Computational Geometry 1996: C-15-C-18 | |
| 1995 | ||
| j8 | Esther M. Arkin, Dan Halperin, Klara Kedem, Joseph S. B. Mitchell, Nir Naor: Arrangements of Segments that Share Endpoints Single Face Results. Discrete & Computational Geometry 13: 257-270 (1995) | |
| c17 | L. Paul Chew, Dorit Dor, Alon Efrat, Klara Kedem: Geometric Pattern Matching in d-Dimensional Space. ESA 1995: 264-279 | |
| c16 | L. Paul Chew, Klara Kedem, Micha Sharir, Boaz Tagansky, Emo Welzl: Voronoi Diagrams of Lines in 3-Space Under Polyhedral Convex Distance Functions. SODA 1995: 197-204 | |
| c15 | Alex Glozman, Klara Kedem, Gregory Shpitalnik: On Some Geometric Selection and Optimization Problems via Sorted Matrices. WADS 1995: 26-37 | |
| 1994 | ||
| c14 | Olivier Devillers, Mordecai J. Golin, Klara Kedem, Stefan Schirra: Revenge of the Dog: Queries on Voronoi Diagrams of Moving Points. CCCG 1994: 122-127 | |
| 1993 | ||
| j7 | L. Paul Chew, Klara Kedem: A Convex Polygon Among Polygonal Obstacles: Placement and High-clearance Motion. Comput. Geom. 3: 59-89 (1993) | |
| j6 | Daniel P. Huttenlocher, Klara Kedem, Micha Sharir: The Upper Envelope of voronoi Surfaces and Its Applications. Discrete & Computational Geometry 9: 267-291 (1993) | |
| c13 | L. Paul Chew, Michael T. Goodrich, Daniel P. Huttenlocher, Klara Kedem, Jon M. Kleinberg, Dina Kravets: Geometric Pattern Matching Under Euclidean Motion. CCCG 1993: 151-156 | |
| c12 | Klara Kedem, Micha Sharir, Sivan Toledo: On Critical Orientations in the Kedem-Sharir Motion Planning Algorithm for a Convex Polygon in the Plane. CCCG 1993: 204-209 | |
| 1992 | ||
| j5 | Esther M. Arkin, Klara Kedem, Joseph S. B. Mitchell, Josef Sprinzak, Michael Werman: Matching Points into Pairwise-Disjoint Noise Regions: Combinatorial Bounds and Algorithms. INFORMS Journal on Computing 4(4): 375-386 (1992) | |
| j4 | Daniel P. Huttenlocher, Klara Kedem, Jon M. Kleinberg: Voronoi Diagrams of Rigidly Moving Sets of Points. Inf. Process. Lett. 43(4): 217-223 (1992) | |
| c11 | Daniel P. Huttenlocher, Klara Kedem, Jon M. Kleinberg: On Dynamic Voronoi Diagrams and the Minimum Hausdorff Distance for Point Sets Under Euclidean Motion in the Plane. Symposium on Computational Geometry 1992: 110-119 | |
| c10 | ||
| 1991 | ||
| j3 | Esther M. Arkin, L. Paul Chew, Daniel P. Huttenlocher, Klara Kedem, Joseph S. B. Mitchell: An Efficiently Computable Metric for Comparing Polygonal Shapes. IEEE Trans. Pattern Anal. Mach. Intell. 13(3): 209-216 (1991) | |
| c9 | Daniel P. Huttenlocher, Klara Kedem, Micha Sharir: The Upper Envelope of Voronoi Surfaces and Its Applications. Symposium on Computational Geometry 1991: 194-203 | |
| c8 | Esther M. Arkin, Dan Halperin, Klara Kedem, Joseph S. B. Mitchell, Nir Naor: Arrangements of Segments that Share Endpoints: Single Face Results. Symposium on Computational Geometry 1991: 324-333 | |
| c7 | Esther M. Arkin, Klara Kedem, Joseph S. B. Mitchell, Josef Sprinzak, Michael Werman: Matching Points into Noise Regions: Combinatorial Bounds and Algorithms. SODA 1991: 42-51 | |
| 1990 | ||
| j2 | Klara Kedem, Micha Sharir: An Efficient Motion-planning Algorithm for a Convex Polygonal Object in Two Dimensional Polygonal Space. Discrete & Computational Geometry 5: 43-75 (1990) | |
| c6 | Daniel P. Huttenlocher, Klara Kedem: Computing the Minimum Hausdorff Distance for Point Sets Under Translation. Symposium on Computational Geometry 1990: 340-349 | |
| c5 | Esther M. Arkin, L. Paul Chew, Daniel P. Huttenlocher, Klara Kedem, Joseph S. B. Mitchell: An Efficiently Computable Metric for Comparing Polygonal Shapes. SODA 1990: 129-137 | |
| 1989 | ||
| c4 | L. Paul Chew, Klara Kedem: Placing the Largest Similar Copy of a Convex Polygon Among Polygonal Obstacles. Symposium on Computational Geometry 1989: 167-173 | |
| 1988 | ||
| c3 | Klara Kedem, Micha Sharir: An Automatic Motion Planning System for a Convex Polygonal Mobile Robot in 2-Dimensional Polygonal Space. Symposium on Computational Geometry 1988: 329-340 | |
| 1986 | ||
| j1 | Klara Kedem, Ron Livne, János Pach, Micha Sharir: On the Union of Jordan Regions and Collision-Free Translational Motion Amidst Polygonal Obstacles. Discrete & Computational Geometry 1: 59-70 (1986) | |
| c2 | Micha Sharir, Richard Cole, Klara Kedem, Daniel Leven, Richard Pollack, Shmuel Sifrony: Geometric Applications of Davenport-Schinzel Sequences. FOCS 1986: 77-86 | |
| 1985 | ||
| c1 | Klara Kedem, Micha Sharir: An efficient algorithm for planning collision-free translational motion of a convex polygonal object in 2-dimensional space amidst polygonal obstacles. Symposium on Computational Geometry 1985: 75-80 | |
Colors in the list of coauthors
Last update Sun May 19 07:13:59 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page