2008 | ||
---|---|---|
82 | Ravi Janardan, Prosenjit Gupta, Yokesh Kumar, Michiel H. M. Smid: Data Structures for Range-Aggregate Extent Queries. CCCG 2008 | |
81 | EE | Yokesh Kumar, Ravi Janardan, Prosenjit Gupta: Efficient algorithms for reverse proximity query problems. GIS 2008: 39 |
80 | EE | Jieping Ye, Kewei Chen, Teresa Wu, Jing Li, Zheng Zhao, Rinkal Patel, Min Bae, Ravi Janardan, Huan Liu, Gene Alexander, Eric Reiman: Heterogeneous data fusion for alzheimer's disease study. KDD 2008: 1025-1033 |
79 | EE | Jieping Ye, Jianhui Chen, Ravi Janardan, Sudhir Kumar: Developmental stage annotation of Drosophila gene expression pattern images via an entire solution path for LDA. TKDD 2(1): (2008) |
2006 | ||
78 | EE | Jieping Ye, Tao Xiong, Qi Li, Ravi Janardan, Jinbo Bi, Vladimir Cherkassky, Chandra Kambhamettu: Efficient model selection for regularized linear discriminant analysis. CIKM 2006: 532-539 |
77 | EE | Jieping Ye, Tao Xiong, Ravi Janardan: CPM: A Covariance-preserving Projection Method. SDM 2006 |
76 | EE | Jieping Ye, Ivaylo Ilinkin, Ravi Janardan, Adam Isom: Multiple Structure Alignment and Consensus Identification for Proteins. WABI 2006: 115-125 |
75 | EE | Ivaylo Ilinkin, Ravi Janardan, Michiel H. M. Smid, Eric Johnson, Paul Castillo, Jörg Schwerdt: Heuristics for estimating contact area of supports in layered manufacturing. ACM Journal of Experimental Algorithmics 11: (2006) |
74 | EE | Jieping Ye, Ravi Janardan, Qi Li, Haesun Park: Feature Reduction via Generalized Uncorrelated Linear Discriminant Analysis. IEEE Trans. Knowl. Data Eng. 18(10): 1312-1322 (2006) |
2005 | ||
73 | EE | Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid: Efficient Non-intersection Queries on Aggregated Geometric Data. COCOON 2005: 544-553 |
72 | EE | Jieping Ye, Qi Li, Hui Xiong, Haesun Park, Ravi Janardan, Vipin Kumar: IDR/QR: An Incremental Dimension Reduction Algorithm via QR Decomposition. IEEE Trans. Knowl. Data Eng. 17(9): 1208-1222 (2005) |
2004 | ||
71 | EE | 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 |
70 | EE | Jieping Ye, Ravi Janardan, Qi Li, Haesun Park: Feature extraction via generalized uncorrelated linear discriminant analysis. ICML 2004 |
69 | EE | Jieping Ye, Ravi Janardan, Qi Li: GPCA: an efficient dimension reduction scheme for image compression and retrieval. KDD 2004: 354-363 |
68 | EE | 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 |
67 | EE | Tao Xiong, Jieping Ye, Qi Li, Ravi Janardan, Vladimir Cherkassky: Efficient Kernel Discriminant Analysis via QR Decomposition. NIPS 2004 |
66 | EE | Jieping Ye, Ravi Janardan, Qi Li: Two-Dimensional Linear Discriminant Analysis. NIPS 2004 |
65 | EE | 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) |
64 | EE | Jieping Ye, Tao Li, Tao Xiong, Ravi Janardan: Using Uncorrelated Discriminant Analysis for Tissue Classification with Gene Expression Data. IEEE/ACM Trans. Comput. Biology Bioinform. 1(4): 181-190 (2004) |
63 | EE | Jieping Ye, Ravi Janardan, Songtao Liu: Pairwise Protein Structure Alignment Based on an Orientation-independent Backbone Representation. J. Bioinformatics and Computational Biology 2(4): 699-718 (2004) |
62 | EE | Jieping Ye, Ravi Janardan: Approximate Multiple Protein Structure Alignment Using the Sum-of-Pairs Distance. Journal of Computational Biology 11(5): 986-1000 (2004) |
2003 | ||
61 | EE | Jieping Ye, Ravi Janardan, Cheong Hee Park, Haesun Park: A new optimization criterion for generalized discriminant analysis on undersampled problems. ICDM 2003: 419-426 |
60 | EE | Jieping Ye, Ravi Janardan, Songtao Liu: Pairwise Protein Structure Alignment Based on an Orientation-Independent Representation of the Backbone Geometry. ICTAI 2003: 2-8 |
59 | EE | 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) |
58 | EE | 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) |
2002 | ||
57 | EE | Ivaylo Ilinkin, Ravi Janardan, Michiel H. M. Smid: Terrain Polygon Decomposition, with Application to Layered Manufacturing. COCOON 2002: 381-390 |
56 | 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) | |
55 | EE | 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) |
2001 | ||
54 | EE | 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 |
53 | EE | 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 |
2000 | ||
52 | 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) | |
1999 | ||
51 | EE | Jörg Schwerdt, Michiel H. M. Smid, Ravi Janardan, Eric Johnson, Jayanth Majhi: Protecting Facets in Layered Manufacturing. FSTTCS 1999: 291-303 |
50 | EE | 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 Algorithmics 4: 8 (1999) |
49 | 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) | |
48 | 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) | |
47 | 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) | |
46 | EE | 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) |
45 | 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) | |
1998 | ||
44 | 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 | |
43 | EE | 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 |
42 | EE | Tony C. Woo, Ravi Janardan: Special Issue: Computational Geometry and Computer-Aided Design and Manufacturing. Computer-Aided Design 30(4): 229 (1998) |
1997 | ||
41 | Jayanth Majhi, Ravi Janardan, Michiel H. M. Smid, Prosenjit Gupta: On Some Geometric Optimization Problems in Layered Manufacturing. WADS 1997: 136-149 | |
40 | EE | 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) |
39 | EE | 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) |
38 | 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) | |
1996 | ||
37 | Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid: Efficient Algorithms for Counting and Reporting Pairwise Intersections Between Convex Polygons. CCCG 1996: 8-13 | |
36 | 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 | |
35 | 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) | |
34 | 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) | |
33 | EE | Prosenjit Gupta, Ravi Janardan, Jayanth Majhi, Tony C. Woo: Efficient geometric algorithms for workpiece orientation in 4- and 5-axis NC machining. Computer-Aided Design 28(8): 577-587 (1996) |
32 | EE | Mario A. Lopez, Ravi Janardan, Sartaj K. Sahni: Efficient net extraction for restricted orientation designs [VLSI layout]. IEEE Trans. on CAD of Integrated Circuits and Systems 15(9): 1151-1159 (1996) |
1995 | ||
31 | EE | 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 |
30 | Prosenjit Gupta, Ravi Janardan, Jayanth Majhi, Tony C. Woo: Efficient Geometric Algorithms for Workpiece Orientation in 4- and 5-Axis NC-Machining. WADS 1995: 171-182 | |
29 | 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) | |
28 | 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) | |
1994 | ||
27 | Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid: Fast Algorithms for Collision and Proximity Problems Involving Moving Geometric Objects. ESA 1994: 278-289 | |
26 | Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid: On Intersection Searching Problems Involving Curved Objects. SWAT 1994: 183-194 | |
25 | EE | 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 |
24 | Ravi Janardan, Franco P. Preparata: Widest-Corridor Problems. Nord. J. Comput. 1(2): 231-245 (1994) | |
1993 | ||
23 | Ravi Janardan, Franco P. Preparata: Widest-corridor Problems. CCCG 1993: 426-431 | |
22 | EE | Mario A. Lopez, Ravi Janardan, Sartaj K. Sahni: A fast algorithm for VLSI net extraction. ICCAD 1993: 770-774 |
21 | Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid: Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization. WADS 1993: 361-372 | |
20 | Ravi Janardan, Mario A. Lopez: Generalized intersection searching problems. Int. J. Comput. Geometry Appl. 3(1): 39-69 (1993) | |
19 | Ravi Janardan: On maintaining the width and diameter of a planar point-set online. Int. J. Comput. Geometry Appl. 3(3): 331-344 (1993) | |
1992 | ||
18 | Siu-Wing Cheng, Ravi Janardan: Algorithms for Ray-Shooting and Intersection Searching. J. Algorithms 13(4): 670-692 (1992) | |
17 | 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) | |
16 | Siu-Wing Cheng, Ravi Janardan: New Results on Dynamic Planar Point Location. SIAM J. Comput. 21(5): 972-999 (1992) | |
1991 | ||
15 | Ravi Janardan: On Maintaining the Width and Diameter of a Planar Point-Set Online. ISA 1991: 137-149 | |
14 | Siu-Wing Cheng, Ravi Janardan: Space-efficient Ray-shooting and Intersection Searching: Algorithms, Dynamization, and Applications. SODA 1991: 7-16 | |
13 | Ravi Janardan: On the Dynamic Maintenance of Maximal Points in the Plane. Inf. Process. Lett. 40(2): 59-64 (1991) | |
12 | Siu-Wing Cheng, Ravi Janardan: Efficient Maintenance of the Union of Intervals on a Line, with Applications. J. Algorithms 12(1): 57-74 (1991) | |
1990 | ||
11 | Siu-Wing Cheng, Ravi Janardan: New Results on Dynamic Planar Point Location FOCS 1990: 96-105 | |
10 | Siu-Wing Cheng, Ravi Janardan: Efficient Maintenance of the Union Intervals on a Line, with Applications. SODA 1990: 74-83 | |
9 | Ravi Janardan, Siu-Wing Cheng: Efficient Distributed Algorithms for Single-Source Shortest Paths and Related Problems on Plane Networks. WDAG 1990: 133-150 | |
8 | Siu-Wing Cheng, Ravi Janardan: Efficient Dynamic Algorithms for Some Geometric Intersection Problems. Inf. Process. Lett. 36(5): 251-258 (1990) | |
7 | Greg N. Frederickson, Ravi Janardan: Space-Efficient Message Routing in c-Decomposable Networks. SIAM J. Comput. 19(1): 164-181 (1990) | |
1989 | ||
6 | Greg N. Frederickson, Ravi Janardan: Efficient Message Routing in Planar Networks. SIAM J. Comput. 18(4): 843-857 (1989) | |
1988 | ||
5 | Greg N. Frederickson, Ravi Janardan: Designing Networks with Compact Routing Tables. Algorithmica 3: 171-190 (1988) | |
4 | Greg N. Frederickson, Ravi Janardan: Space-Efficient and Fault-Tolerant Message Routing in Outerplanar Networks. IEEE Trans. Computers 37(12): 1529-1540 (1988) | |
1986 | ||
3 | Greg N. Frederickson, Ravi Janardan: Separator-Based Strategies for Efficient Message Routing (Preliminary Version) FOCS 1986: 428-437 | |
2 | Greg N. Frederickson, Ravi Janardan: Optimal Message Routing without Complete Routing Tables (preliminary version). PODC 1986: 88-97 | |
1982 | ||
1 | Ravi Janardan, K. B. Lakshmanan: A Public-Key Cryptosystem Based on the Matrix Cover NP-Complete Problem. CRYPTO 1982: 21-37 |