| |
      |
                                          |
Note: Links lead to the DBLP on the Web. Ravi Janardan Ivaylo Ilinkin , Ravi Janardan, Michiel H. M. Smid , Eric Johnson , Paul Castillo , Jörg Schwerdt : Approximating contact-area of supports in layered manufacturing. CCCG 2004 : 91-94 Jieping Ye , Ravi Janardan, Qi Li , Haesun Park : Feature extraction via generalized uncorrelated linear discriminant analysis. ICML 2004 Jieping Ye , Ravi Janardan, Qi Li : GPCA: an efficient dimension reduction scheme for image compression and retrieval. KDD 2004 : 354-363 Jieping Ye , Qi Li , Hui Xiong , Haesun Park , Ravi Janardan, Vipin Kumar : IDR/QR: an incremental dimension reduction algorithm via QR decomposition. KDD 2004 : 364-373 Jieping Ye , Ravi Janardan, Cheong Hee Park , Haesun Park : An Optimization Criterion for Generalized Discriminant Analysis on Undersampled Problems. IEEE Trans. Pattern Anal. Mach. Intell. 26 (8): 982-994 (2004) Jieping Ye , Ravi Janardan, Cheong Hee Park , Haesun Park : A new optimization criterion for generalized discriminant analysis on undersampled problems. ICDM 2003 : 419-426 Jieping Ye , Ravi Janardan, Songtao Liu : Pairwise Protein Structure Alignment Based on an Orientation-Independent Representation of the Backbone Geometry. ICTAI 2003 : 2-8 Man Chung Hon , Ravi Janardan, Jörg Schwerdt , Michiel H. M. Smid : Minimizing the total projection of a set of vectors, with applications to layered manufacturing. Computer-Aided Design 35 (1): 57-68 (2003) Jörg Schwerdt , Michiel H. M. Smid , Ravi Janardan, Eric Johnson : Protecting critical facets in layered manufacturing: implementation and experimental results. Computer-Aided Design 35 (7): 647-657 (2003) Ivaylo Ilinkin , Ravi Janardan, Michiel H. M. Smid : Terrain Polygon Decomposition, with Application to Layered Manufacturing. COCOON 2002 : 381-390 Ivaylo Ilinkin , Ravi Janardan, Jayanth Majhi , Jörg Schwerdt , Michiel H. M. Smid , Ram D. Sriram : A decomposition-based approach to layered manufacturing. Comput. Geom. 23 (2): 117-151 (2002) Jörg Schwerdt , Michiel H. M. Smid , Man Chung Hon , Ravi Janardan: Computing an Optimal Hatching Direction in Layered Manufacturing. Int. J. Comput. Math. 79 (10): 1067-1081 (2002) Man Chung Hon , Ravi Janardan, Jörg Schwerdt , Michiel H. M. Smid : Computing Optimal Hatching Directions in Layered Manufacturing. International Conference on Computational Science (1) 2001 : 683-692 Ivaylo Ilinkin , Ravi Janardan, Jayanth Majhi , Jörg Schwerdt , Michiel H. M. Smid , Ram D. Sriram : A Decomposition-Based Approach to Layered Manufacturing. WADS 2001 : 389-400 Jörg Schwerdt , Michiel H. M. Smid , Ravi Janardan, Eric Johnson , Jayanth Majhi : Protecting critical facets in layered manufacturing. Comput. Geom. 16 (3): 187-210 (2000) Jörg Schwerdt , Michiel H. M. Smid , Ravi Janardan, Eric Johnson , Jayanth Majhi : Protecting Facets in Layered Manufacturing. FSTTCS 1999 : 291-303 Jörg Schwerdt , Michiel H. M. Smid , Jayanth Majhi , Ravi Janardan: Computing the Width of a Three-Dimensional Point Set: An Experimental Study. ACM Journal of Experimental Algorithms 4 : 8 (1999) Jayanth Majhi , Ravi Janardan, Michiel H. M. Smid , Prosenjit Gupta : On some geometric optimization problems in layered manufacturing. Comput. Geom. 12 (3-4): 219-239 (1999) Jayanth Majhi , Ravi Janardan, Jörg Schwerdt , Michiel H. M. Smid , Prosenjit Gupta : Minimizing support structures and trapped area in two-dimensional layered manufacturing. Comput. Geom. 12 (3-4): 241-267 (1999) Jayanth Majhi , Prosenjit Gupta , Ravi Janardan: Computing a flattest, undercut-free parting line for a convex polyhedron, with application to mold design. Comput. Geom. 13 (4): 229-252 (1999) Prosenjit Gupta , Ravi Janardan, Michiel H. M. Smid : Efficient Algorithms for Counting and Reporting Pairwise Intersections Between Convex Polygons. Inf. Process. Lett. 69 (1): 7-13 (1999) Michiel H. M. Smid , Ravi Janardan: On the width and roundness of a set of points in the plane. Int. J. Comput. Geometry Appl. 9 (1): 97-108 (1999) Jörg Schwerdt , Michiel H. M. Smid , Jayanth Majhi , Ravi Janardan: Computing the Width of a Three-Dimensional Point Set: An Experimental Study. Algorithm Engineering 1998 : 62-73 Jayanth Majhi , Ravi Janardan, Michiel H. M. Smid , Jörg Schwerdt : Multi-Criteria Geometric Optimization Problems in Layered Manufacturing. Symposium on Computational Geometry 1998 : 19-28 Tony C. Woo , Ravi Janardan: Special Issue: Computational Geometry and Computer-Aided Design and Manufacturing. Computer-Aided Design 30 (4): 229 (1998) Jayanth Majhi , Ravi Janardan, Michiel H. M. Smid , Prosenjit Gupta : On Some Geometric Optimization Problems in Layered Manufacturing. WADS 1997 : 136-149 Kai Tang , Ming-En Wang , Lin-Lin Chen , Shuo-Yan Chou , Tony C. Woo , Ravi Janardan: Computing planar swept polygons under translation. Computer-Aided Design 29 (12): 825-836 (1997) Prosenjit Gupta , Ravi Janardan, Michiel H. M. Smid : A Technique for Adding Range Restrictions to Generalized Searching Problems. Inf. Process. Lett. 64 (5): 263-269 (1997) Prosenjit Gupta , Ravi Janardan, Michiel H. M. Smid , Bhaskar DasGupta : The Rectangle Enclosure and Point-Dominance Problems Revisited. Int. J. Comput. Geometry Appl. 7 (5): 437-455 (1997) Prosenjit Gupta , Ravi Janardan, Michiel H. M. Smid : Efficient Algorithms for Counting and Reporting Pairwise Intersections Between Convex Polygons. CCCG 1996 : 8-13 Jayanth Majhi , Prosenjit Gupta , Ravi Janardan: Computing a Flattest, Undercut-Free Parting Line for a Convex Polyhedron, with Application to Mold Design. WACG 1996 : 109-120 Prosenjit Gupta , Ravi Janardan, Michiel H. M. Smid : Algorithms for Generalized Halfspace Range Searching and Other Intersection Searching Problems. Comput. Geom. 6 : 1-19 (1996) Prosenjit Gupta , Ravi Janardan, Michiel H. M. Smid : Fast Algorithms for Collision and Proximity Problems Involving Moving Geometric Objects. Comput. Geom. 6 : 371-391 (1996) Prosenjit Gupta , Ravi Janardan, Jayanth Majhi , Tony Woo : Efficient geometric algorithms for workpiece orientation in 4- and 5-axis NC machining. Computer-Aided Design 28 (8): 577-587 (1996) Prosenjit Gupta , Ravi Janardan, Michiel H. M. Smid , Bhaskar DasGupta : The Rectangle Enclosure and Point-Dominance Problems Revisited. Symposium on Computational Geometry 1995 : 162-171 Prosenjit Gupta , Ravi Janardan, Jayanth Majhi , Tony Woo : Efficient Geometric Algorithms for Workpiece Orientation in 4- and 5-Axis NC-Machining. WADS 1995 : 171-182 Prosenjit Gupta , Ravi Janardan, Michiel H. M. Smid : Algorithms for Generalized Halfspace Range Searching and Other Intersection Searching Problems. Comput. Geom. 5 : 321-340 (1995) Prosenjit Gupta , Ravi Janardan, Michiel H. M. Smid : Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization. J. Algorithms 19 (2): 282-317 (1995) Prosenjit Gupta , Ravi Janardan, Michiel H. M. Smid : Fast Algorithms for Collision and Proximity Problems Involving Moving Geometric Objects. ESA 1994 : 278-289 Prosenjit Gupta , Ravi Janardan, Michiel H. M. Smid : On Intersection Searching Problems Involving Curved Objects. SWAT 1994 : 183-194 Prosenjit Gupta , Ravi Janardan, Michiel H. M. Smid : Efficient Algorithms for Generalized Intersection Searching on Non-Iso-Oriented Objects. Symposium on Computational Geometry 1994 : 369-378 Ravi Janardan, Franco P. Preparata : Widest-Corridor Problems. Nord. J. Comput. 1 (2): 231-245 (1994) Ravi Janardan, Franco P. Preparata : Widest-corridor Problems. CCCG 1993 : 426-431 Prosenjit Gupta , Ravi Janardan, Michiel H. M. Smid : Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization. WADS 1993 : 361-372 Ravi Janardan, M. Lopez : Generalized intersection searching problems. Int. J. Comput. Geometry Appl. 3 (1): 39-69 (1993) Ravi Janardan: On maintaining the width and diameter of a planar point-set online. Int. J. Comput. Geometry Appl. 3 (3): 331-344 (1993) Siu-Wing Cheng , Ravi Janardan: Algorithms for Ray-Shooting and Intersection Searching. J. Algorithms 13 (4): 670-692 (1992) Ravi Janardan, Siu-Wing Cheng : Efficient Distributed Algorithms for Single-Source Shortest Paths and Related Problems on Plane Networks. Mathematical Systems Theory 25 (2): 93-122 (1992) Siu-Wing Cheng , Ravi Janardan: New Results on Dynamic Planar Point Location. SIAM J. Comput. 21 (5): 972-999 (1992) Ravi Janardan: On Maintaining the Width and Diameter of a Planar Point-Set Online. ISA 1991 : 137-149 Siu-Wing Cheng , Ravi Janardan: Space-efficient Ray-shooting and Intersection Searching: Algorithms, Dynamization, and Applications. SODA 1991 : 7-16 Ravi Janardan: On the Dynamic Maintenance of Maximal Points in the Plane. Inf. Process. Lett. 40 (2): 59-64 (1991) Siu-Wing Cheng , Ravi Janardan: Efficient Maintenance of the Union of Intervals on a Line, with Applications. J. Algorithms 12 (1): 57-74 (1991) Siu-Wing Cheng , Ravi Janardan: New Results on Dynamic Planar Point Location FOCS 1990 : 96-105 Siu-Wing Cheng , Ravi Janardan: Efficient Maintenance of the Union Intervals on a Line, with Applications. SODA 1990 : 74-83 Ravi Janardan, Siu-Wing Cheng : Efficient Distributed Algorithms for Single-Source Shortest Paths and Related Problems on Plane Networks. WDAG 1990 : 133-150 Siu-Wing Cheng , Ravi Janardan: Efficient Dynamic Algorithms for Some Geometric Intersection Problems. Inf. Process. Lett. 36 (5): 251-258 (1990) Greg N. Frederickson , Ravi Janardan: Space-Efficient Message Routing in c-Decomposable Networks. SIAM J. Comput. 19 (1): 164-181 (1990) Greg N. Frederickson , Ravi Janardan: Efficient Message Routing in Planar Networks. SIAM J. Comput. 18 (4): 843-857 (1989) Greg N. Frederickson , Ravi Janardan: Designing Networks with Compact Routing Tables. Algorithmica 3 : 171-190 (1988) Greg N. Frederickson , Ravi Janardan: Space-Efficient and Fault-Tolerant Message Routing in Outerplanar Networks. IEEE Trans. Computers 37 (12): 1529-1540 (1988) Greg N. Frederickson , Ravi Janardan: Separator-Based Strategies for Efficient Message Routing (Preliminary Version) FOCS 1986 : 428-437 Greg N. Frederickson , Ravi Janardan: Optimal Message Routing without Complete Routing Tables (preliminary version). PODC 1986 : 88-97 Ravi Janardan, K. B. Lakshmanan : A Public-Key Cryptosystem Based on the Matrix Cover NP-Complete Problem. CRYPTO 1982 : 21-37 1 [ 64 ] 2 [ 38 ] 3 [ 8 ] [ 9 ] [ 10 ] [ 11 ] [ 12 ] [ 14 ] [ 16 ] [ 17 ] [ 18 ] 4 [ 38 ] 5 [ 30 ] [ 36 ] 6 [ 2 ] [ 3 ] [ 4 ] [ 5 ] [ 6 ] [ 7 ] 7 [ 21 ] [ 24 ] [ 25 ] [ 26 ] [ 27 ] [ 28 ] [ 29 ] [ 30 ] [ 31 ] [ 32 ] [ 33 ] [ 34 ] [ 35 ] [ 36 ] [ 37 ] [ 39 ] [ 44 ] [ 45 ] [ 46 ] [ 47 ] 8 [ 52 ] [ 53 ] [ 57 ] 9 [ 51 ] [ 54 ] [ 55 ] [ 64 ] 10 [ 49 ] [ 50 ] [ 56 ] [ 64 ] 11 [ 61 ] 12 [ 1 ] 13 [ 61 ] [ 62 ] [ 63 ] 14 [ 58 ] 15 [ 20 ] 16 [ 29 ] [ 31 ] [ 34 ] [ 39 ] [ 41 ] [ 42 ] [ 45 ] [ 46 ] [ 47 ] [ 48 ] [ 49 ] [ 50 ] [ 51 ] [ 54 ] 17 [ 59 ] [ 60 ] 18 [ 59 ] [ 60 ] [ 61 ] [ 63 ] 19 [ 22 ] [ 23 ] 20 [ 41 ] [ 42 ] [ 46 ] [ 48 ] [ 49 ] [ 50 ] [ 51 ] [ 52 ] [ 53 ] [ 54 ] [ 56 ] [ 57 ] [ 64 ] 21 [ 21 ] [ 24 ] [ 25 ] [ 26 ] [ 27 ] [ 28 ] [ 30 ] [ 32 ] [ 33 ] [ 35 ] [ 36 ] [ 37 ] [ 39 ] [ 41 ] [ 42 ] [ 43 ] [ 44 ] [ 46 ] [ 47 ] [ 48 ] [ 49 ] [ 50 ] [ 51 ] [ 52 ] [ 53 ] [ 54 ] [ 55 ] [ 56 ] [ 57 ] [ 64 ] 22 [ 51 ] [ 54 ] 23 [ 38 ] 24 [ 38 ] 25 [ 29 ] [ 31 ] 26 [ 38 ] [ 40 ] 27 [ 61 ] 28 [ 58 ] [ 59 ] [ 60 ] [ 61 ] [ 62 ] [ 63 ]  ©2005 Association for Computing Machinery |
