2008 | ||
---|---|---|
61 | EE | 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) |
2007 | ||
60 | Dror Aiger, Klara Kedem: Exact and Approximate Geometric Pattern Matching for Point Sets in the Plane under Similarity Transformations. CCCG 2007: 181-184 | |
59 | EE | 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) |
58 | EE | 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) |
2005 | ||
57 | EE | 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 |
56 | EE | 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 |
55 | EE | 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) |
2004 | ||
54 | EE | Oriel Bergig, Danny Barash, Klara Kedem: RNA Motif Search Using the Structure to String (STR2) Method. CSB 2004: 660-661 |
53 | EE | 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 |
52 | EE | 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) |
51 | EE | 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) |
2003 | ||
50 | EE | L. Paul Chew, Klara Kedem: Finding the Consensus Shape for a Protein Family. Algorithmica 38(1): 115-129 (2003) |
2002 | ||
49 | EE | Angela Enosh, Klara Kedem, Joel Bernstein: Determining Similarity of Conformational Polymorphs. ESA 2002: 436-448 |
48 | EE | L. Paul Chew, Klara Kedem: Finding the consensus shape for a protein family. Symposium on Computational Geometry 2002: 64-73 |
47 | Matthew J. Katz, Klara Kedem: Sixteenth European Workshop on Computational Geometry - Editorial. Comput. Geom. 21(1-2): 1 (2002) | |
46 | EE | Matthew J. Katz, Klara Kedem, Michael Segal: Improved algorithms for placing undesirable facilities. Computers & OR 29(13): 1859-1872 (2002) |
45 | EE | L. Paul Chew, Haggai David, Matthew J. Katz, Klara Kedem: Walking around fat obstacles. Inf. Process. Lett. 83(3): 135-140 (2002) |
2000 | ||
44 | Matthew J. Katz, Klara Kedem, Michael Segal: Discrete rectilinear 2-center problems. Comput. Geom. 15(4): 203-214 (2000) | |
43 | 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 | ||
42 | EE | Matthew J. Katz, Klara Kedem, Michael Segal: Improved algorithms for placing undesirable facilities. CCCG 1999 |
41 | EE | L. Paul Chew, Daniel P. Huttenlocher, Klara Kedem, Jon M. Kleinberg: Fast detection of common geometric substructure in proteins. RECOMB 1999: 104-114 |
40 | EE | Sergei Bespamyatnikh, Klara Kedem, Michael Segal: Optimal Facility Location under Various Distance Functions. WADS 1999: 318-329 |
39 | EE | L. Paul Chew, Dorit Dor, Alon Efrat, Klara Kedem: Geometric Pattern Matching in d -Dimensional Space. Discrete & Computational Geometry 21(2): 257-274 (1999) |
38 | 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) | |
37 | 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): (1999) | |
1998 | ||
36 | EE | Matthew J. Katz, Klara Kedem, Michael Segal: Constrained Square-Center Problems. SWAT 1998: 95-106 |
35 | L. Paul Chew, Klara Kedem: Getting around a lower bound for the minimum Hausdorff distance. Comput. Geom. 10(3): 197-202 (1998) | |
34 | Alex Glozman, Klara Kedem, Gregory Shpitalnik: On some geometric selection and optimization problems via sorted matrices. Comput. Geom. 11(1): 17-28 (1998) | |
33 | Michael Segal, Klara Kedem: Geometric applications of posets. Comput. Geom. 11(3-4): 143-156 (1998) | |
32 | EE | Michael Segal, Klara Kedem: Enclosing k Points in the Smallest Axis Parallel Rectangle. Inf. Process. Lett. 65(2): 95-99 (1998) |
31 | 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) | |
1997 | ||
30 | Michael Segal, Klara Kedem: Geometric Applications Of Posets. WADS 1997: 402-415 | |
29 | 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) | |
28 | EE | Klara Kedem, Micha Sharir, Sivan Toledo: On Critical Orientations in the Kedem-Sharir Motion Planning Algorithm. Discrete & Computational Geometry 17(2): 227-239 (1997) |
27 | Klara Kedem, Daniel Cohen-Or: Efficient Bitmap Resemblance Under Translations. Int. J. Comput. Geometry Appl. 7(1/2): 57-84 (1997) | |
1996 | ||
26 | Michael Segal, Klara Kedem: Enclosing K Points in the Smallest Axis Parallel Rectangle. CCCG 1996: 20-25 | |
25 | EE | Klara Kedem, Yana Yarmovski: Curve Based Stereo Matching Using the Minimum Hausdorff Distance. Symposium on Computational Geometry 1996: C-15-C-18 |
24 | Olivier Devillers, Mordecai J. Golin, Klara Kedem, Stefan Schirra: Queries on Voronoi Diagrams of Moving Points. Comput. Geom. 6: 315-327 (1996) | |
1995 | ||
23 | L. Paul Chew, Dorit Dor, Alon Efrat, Klara Kedem: Geometric Pattern Matching in d-Dimensional Space. ESA 1995: 264-279 | |
22 | 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 | |
21 | Alex Glozman, Klara Kedem, Gregory Shpitalnik: On Some Geometric Selection and Optimization Problems via Sorted Matrices. WADS 1995: 26-37 | |
20 | 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) | |
1994 | ||
19 | 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 | ||
18 | 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 | |
17 | 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 | |
16 | L. Paul Chew, Klara Kedem: A Convex Polygon Among Polygonal Obstacles: Placement and High-clearance Motion. Comput. Geom. 3: 59-89 (1993) | |
15 | Daniel P. Huttenlocher, Klara Kedem, Micha Sharir: The Upper Envelope of voronoi Surfaces and Its Applications. Discrete & Computational Geometry 9: 267-291 (1993) | |
1992 | ||
14 | L. Paul Chew, Klara Kedem: Improvements on Geometric Pattern Matching Problems. SWAT 1992: 318-325 | |
13 | EE | 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 |
12 | Daniel P. Huttenlocher, Klara Kedem, Jon M. Kleinberg: Voronoi Diagrams of Rigidly Moving Sets of Points. Inf. Process. Lett. 43(4): 217-223 (1992) | |
1991 | ||
11 | 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 | |
10 | EE | Daniel P. Huttenlocher, Klara Kedem, Micha Sharir: The Upper Envelope of Voronoi Surfaces and Its Applications. Symposium on Computational Geometry 1991: 194-203 |
9 | EE | 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 |
8 | EE | 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) |
1990 | ||
7 | 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 | |
6 | EE | Daniel P. Huttenlocher, Klara Kedem: Computing the Minimum Hausdorff Distance for Point Sets Under Translation. Symposium on Computational Geometry 1990: 340-349 |
5 | 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) | |
1989 | ||
4 | EE | 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 | ||
3 | EE | 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 | ||
2 | Micha Sharir, Richard Cole, Klara Kedem, Daniel Leven, Richard Pollack, Shmuel Sifrony: Geometric Applications of Davenport-Schinzel Sequences FOCS 1986: 77-86 | |
1 | 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) |