Ravi Janardan

Bing Citeseer DBLP Google Google Scholar Kosmix Wikipedia Yahoo!
Loading Google Thumbnails...
2012
88Building a Communication Bridge With Mobile Hubs. Onur Tekdas, Yokesh Kumar, Volkan Isler, Ravi Janardan. IEEE T. Automation Science and Engineering (9): 171-176 (2012). Web SearchBibTeXDownload
2011
87Efficient Top-k Queries for Orthogonal Ranges. Saladi Rahul, Prosenjit Gupta, Ravi Janardan, K. S. Rajan. WALCOM 2011, 110-121. Web SearchBibTeXDownload
2010
86Multiple structure alignment and consensus identification for proteins. Ivaylo Ilinkin, Jieping Ye, Ravi Janardan. BMC Bioinformatics (11): 71 (2010). Web SearchBibTeXDownload
2009
85Building a Communication Bridge with Mobile Hubs. Onur Tekdas, Yokesh Kumar, Volkan Isler, Ravi Janardan. ALGOSENSORS 2009, 179-190. Web SearchBibTeXDownload
84Biological Image Analysis via Matrix Approximation. Jieping Ye, Ravi Janardan, Sudhir Kumar. Encyclopedia of Data Warehousing and Mining 2009, 166-170. Web SearchBibTeXDownload
83Efficient Non-Intersection Queries on Aggregated Geometric Data. Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid. Int. J. Comput. Geometry Appl. (19): 479-506 (2009). Web SearchBibTeXDownload
2008
82Data Structures for Range-Aggregate Extent Queries. Ravi Janardan, Prosenjit Gupta, Yokesh Kumar, Michiel H. M. Smid. CCCG 2008. Web SearchBibTeX
81Efficient algorithms for reverse proximity query problems. Yokesh Kumar, Ravi Janardan, Prosenjit Gupta. GIS 2008, 39. Web SearchBibTeXDownload
80Heterogeneous data fusion for alzheimer's disease study. Jieping Ye, Kewei Chen, Teresa Wu, Jing Li, Zheng Zhao, Rinkal Patel, Min Bae, Ravi Janardan, Huan Liu, Gene Alexander, Eric Reiman. KDD 2008, 1025-1033. Web SearchBibTeXDownload
79Developmental stage annotation of Drosophila gene expression pattern images via an entire solution path for LDA. Jieping Ye, Jianhui Chen, Ravi Janardan, Sudhir Kumar. TKDD (2) (2008). Web SearchBibTeXDownload
2006
78Heuristics for estimating contact area of supports in layered manufacturing. Ivaylo Ilinkin, Ravi Janardan, Michiel H. M. Smid, Eric Johnson, Paul Castillo, Jörg Schwerdt. ACM Journal of Experimental Algorithmics (11) (2006). Web SearchBibTeXDownload
77Efficient model selection for regularized linear discriminant analysis. Jieping Ye, Tao Xiong, Qi Li, Ravi Janardan, Jinbo Bi, Vladimir Cherkassky, Chandra Kambhamettu. CIKM 2006, 532-539. Web SearchBibTeXDownload
76Feature Reduction via Generalized Uncorrelated Linear Discriminant Analysis. Jieping Ye, Ravi Janardan, Qi Li, Haesun Park. IEEE Trans. Knowl. Data Eng. (18): 1312-1322 (2006). Web SearchBibTeXDownload
75CPM: A Covariance-preserving Projection Method. Jieping Ye, Tao Xiong, Ravi Janardan. SDM 2006. Web SearchBibTeXDownload
74Multiple Structure Alignment and Consensus Identification for Proteins. Jieping Ye, Ivaylo Ilinkin, Ravi Janardan, Adam Isom. WABI 2006, 115-125. Web SearchBibTeXDownload
2005
73Efficient Non-intersection Queries on Aggregated Geometric Data. Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid. COCOON 2005, 544-553. Web SearchBibTeXDownload
72IDR/QR: An Incremental Dimension Reduction Algorithm via QR Decomposition. Jieping Ye, Qi Li, Hui Xiong, Haesun Park, Ravi Janardan, Vipin Kumar. IEEE Trans. Knowl. Data Eng. (17): 1208-1222 (2005). Cited by 27Web SearchBibTeXDownload
2004
71Approximating contact-area of supports in layered manufacturing. Ivaylo Ilinkin, Ravi Janardan, Michiel H. M. Smid, Eric Johnson, Paul Castillo, Jörg Schwerdt. CCCG 2004, 91-94. Web SearchBibTeXDownload
70Feature extraction via generalized uncorrelated linear discriminant analysis. Jieping Ye, Ravi Janardan, Qi Li, Haesun Park. ICML 2004. Web SearchBibTeXDownload
69Using Uncorrelated Discriminant Analysis for Tissue Classification with Gene Expression Data. Jieping Ye, Tao Li, Tao Xiong, Ravi Janardan. IEEE/ACM Trans. Comput. Biology Bioinform. (1): 181-190 (2004). Web SearchBibTeXDownload
68An Optimization Criterion for Generalized Discriminant Analysis on Undersampled Problems. Jieping Ye, Ravi Janardan, Cheong Hee Park, Haesun Park. IEEE Trans. Pattern Anal. Mach. Intell. (26): 982-994 (2004). Web SearchBibTeXDownload
67Pairwise Protein Structure Alignment Based on an Orientation-independent Backbone Representation. Jieping Ye, Ravi Janardan, Songtao Liu. J. Bioinformatics and Computational Biology (2): 699-718 (2004). Web SearchBibTeXDownload
66Approximate Multiple Protein Structure Alignment Using the Sum-of-Pairs Distance. Jieping Ye, Ravi Janardan. Journal of Computational Biology (11): 986-1000 (2004). Web SearchBibTeXDownload
65GPCA: an efficient dimension reduction scheme for image compression and retrieval. Jieping Ye, Ravi Janardan, Qi Li. KDD 2004, 354-363. Web SearchBibTeXDownload
64IDR/QR: an incremental dimension reduction algorithm via QR decomposition. Jieping Ye, Qi Li, Hui Xiong, Haesun Park, Ravi Janardan, Vipin Kumar. KDD 2004, 364-373. Web SearchBibTeXDownload
63Two-Dimensional Linear Discriminant Analysis. Jieping Ye, Ravi Janardan, Qi Li. NIPS 2004. Web SearchBibTeXDownload
62Efficient Kernel Discriminant Analysis via QR Decomposition. Tao Xiong, Jieping Ye, Qi Li, Ravi Janardan, Vladimir Cherkassky. NIPS 2004. Web SearchBibTeXDownload
2003
61Minimizing the total projection of a set of vectors, with applications to layered manufacturing. Man Chung Hon, Ravi Janardan, Jörg Schwerdt, Michiel H. M. Smid. Computer-Aided Design (35): 57-68 (2003). Web SearchBibTeXDownload
60Protecting critical facets in layered manufacturing: implementation and experimental results. Jörg Schwerdt, Michiel H. M. Smid, Ravi Janardan, Eric Johnson. Computer-Aided Design (35): 647-657 (2003). Web SearchBibTeXDownload
59A new optimization criterion for generalized discriminant analysis on undersampled problems. Jieping Ye, Ravi Janardan, Cheong Hee Park, Haesun Park. ICDM 2003, 419-426. Web SearchBibTeXDownload
58Pairwise Protein Structure Alignment Based on an Orientation-Independent Representation of the Backbone Geometry. Jieping Ye, Ravi Janardan, Songtao Liu. ICTAI 2003, 2-8. Web SearchBibTeXDownload
2002
57Terrain Polygon Decomposition, with Application to Layered Manufacturing. Ivaylo Ilinkin, Ravi Janardan, Michiel H. M. Smid. COCOON 2002, 381-390. Web SearchBibTeXDownload
56A decomposition-based approach to layered manufacturing. Ivaylo Ilinkin, Ravi Janardan, Jayanth Majhi, Jörg Schwerdt, Michiel H. M. Smid, Ram D. Sriram. Comput. Geom. (23): 117-151 (2002). Web SearchBibTeXDownload
55Computing an Optimal Hatching Direction in Layered Manufacturing. Jörg Schwerdt, Michiel H. M. Smid, Man Chung Hon, Ravi Janardan. Int. J. Comput. Math. (79): 1067-1081 (2002). Web SearchBibTeXDownload
2001
54Computing Optimal Hatching Directions in Layered Manufacturing. Man Chung Hon, Ravi Janardan, Jörg Schwerdt, Michiel H. M. Smid. International Conference on Computational Science (1) 2001, 683-692. Web SearchBibTeXDownload
53A Decomposition-Based Approach to Layered Manufacturing. Ivaylo Ilinkin, Ravi Janardan, Jayanth Majhi, Jörg Schwerdt, Michiel H. M. Smid, Ram D. Sriram. WADS 2001, 389-400. Web SearchBibTeXDownload
2000
52Protecting critical facets in layered manufacturing. Jörg Schwerdt, Michiel H. M. Smid, Ravi Janardan, Eric Johnson, Jayanth Majhi. Comput. Geom. (16): 187-210 (2000). Web SearchBibTeXDownload
1999
51Computing the Width of a Three-Dimensional Point Set: An Experimental Study. Jörg Schwerdt, Michiel H. M. Smid, Jayanth Majhi, Ravi Janardan. ACM Journal of Experimental Algorithmics (4): 8 (1999). Web SearchBibTeXDownload
50On some geometric optimization problems in layered manufacturing. Jayanth Majhi, Ravi Janardan, Michiel H. M. Smid, Prosenjit Gupta. Comput. Geom. (12): 219-239 (1999). Web SearchBibTeXDownload
49Computing a flattest, undercut-free parting line for a convex polyhedron, with application to mold design. Jayanth Majhi, Prosenjit Gupta, Ravi Janardan. Comput. Geom. (13): 229-252 (1999). Web SearchBibTeXDownload
48Minimizing support structures and trapped area in two-dimensional layered manufacturing. Jayanth Majhi, Ravi Janardan, Jörg Schwerdt, Michiel H. M. Smid, Prosenjit Gupta. Comput. Geom. (12): 241-267 (1999). Web SearchBibTeXDownload
47Protecting Facets in Layered Manufacturing. Jörg Schwerdt, Michiel H. M. Smid, Ravi Janardan, Eric Johnson, Jayanth Majhi. FSTTCS 1999, 291-303. Web SearchBibTeXDownload
46Efficient Algorithms for Counting and Reporting Pairwise Intersections Between Convex Polygons. Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid. Inf. Process. Lett. (69): 7-13 (1999). Web SearchBibTeXDownload
45On the width and roundness of a set of points in the plane. Michiel H. M. Smid, Ravi Janardan. Int. J. Comput. Geometry Appl. (9): 97-108 (1999). Web SearchBibTeX
1998
44Computing the Width of a Three-Dimensional Point Set: An Experimental Study. Jörg Schwerdt, Michiel H. M. Smid, Jayanth Majhi, Ravi Janardan. Algorithm Engineering 1998, 62-73. Web SearchBibTeX
43Special Issue: Computational Geometry and Computer-Aided Design and Manufacturing. Tony C. Woo, Ravi Janardan. Computer-Aided Design (30): 229 (1998). Web SearchBibTeXDownload
42Multi-Criteria Geometric Optimization Problems in Layered Manufacturing. Jayanth Majhi, Ravi Janardan, Michiel H. M. Smid, Jörg Schwerdt. Symposium on Computational Geometry 1998, 19-28. Web SearchBibTeXDownload
1997
41Computing planar swept polygons under translation. Kai Tang, Ming-En Wang, Lin-Lin Chen, Shuo-Yan Chou, Tony C. Woo, Ravi Janardan. Computer-Aided Design (29): 825-836 (1997). Web SearchBibTeXDownload
40A Technique for Adding Range Restrictions to Generalized Searching Problems. Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid. Inf. Process. Lett. (64): 263-269 (1997). Web SearchBibTeXDownload
39The Rectangle Enclosure and Point-Dominance Problems Revisited. Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid, Bhaskar DasGupta. Int. J. Comput. Geometry Appl. (7): 437-455 (1997). Web SearchBibTeX
38On Some Geometric Optimization Problems in Layered Manufacturing. Jayanth Majhi, Ravi Janardan, Michiel H. M. Smid, Prosenjit Gupta. WADS 1997, 136-149. Web SearchBibTeXDownload
1996
37Efficient Algorithms for Counting and Reporting Pairwise Intersections Between Convex Polygons. Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid. CCCG 1996, 8-13. Web SearchBibTeX
36Efficient geometric algorithms for workpiece orientation in 4- and 5-axis NC machining. Prosenjit Gupta, Ravi Janardan, Jayanth Majhi, Tony C. Woo. Computer-Aided Design (28): 577-587 (1996). Web SearchBibTeXDownload
35Fast Algorithms for Collision and Proximity Problems Involving Moving Geometric Objects. Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid. Comput. Geom. (6): 371-391 (1996). Web SearchBibTeXDownload
34Algorithms for Generalized Halfspace Range Searching and Other Intersection Searching Problems. Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid. Comput. Geom. (6): 1-19 (1996). Web SearchBibTeXDownload
33Efficient net extraction for restricted orientation designs [VLSI layout]. Mario A. Lopez, Ravi Janardan, Sartaj K. Sahni. IEEE Trans. on CAD of Integrated Circuits and Systems (15): 1151-1159 (1996). Web SearchBibTeXDownload
32Computing a Flattest, Undercut-Free Parting Line for a Convex Polyhedron, with Application to Mold Design. Jayanth Majhi, Prosenjit Gupta, Ravi Janardan. WACG 1996, 109-120. Web SearchBibTeXDownload
1995
31Algorithms for Generalized Halfspace Range Searching and Other Intersection Searching Problems. Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid. Comput. Geom. (5): 321-340 (1995). Web SearchBibTeXDownload
30Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization. Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid. J. Algorithms (19): 282-317 (1995). Web SearchBibTeXDownload
29The Rectangle Enclosure and Point-Dominance Problems Revisited. Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid, Bhaskar DasGupta. Symposium on Computational Geometry 1995, 162-171. Web SearchBibTeXDownload
28Efficient Geometric Algorithms for Workpiece Orientation in 4- and 5-Axis NC-Machining. Prosenjit Gupta, Ravi Janardan, Jayanth Majhi, Tony C. Woo. WADS 1995, 171-182. Web SearchBibTeXDownload
1994
27Fast Algorithms for Collision and Proximity Problems Involving Moving Geometric Objects. Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid. ESA 1994, 278-289. Web SearchBibTeXDownload
26Widest-Corridor Problems. Ravi Janardan, Franco P. Preparata. Nord. J. Comput. (1): 231-245 (1994). Web SearchBibTeX
25On Intersection Searching Problems Involving Curved Objects. Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid. SWAT 1994, 183-194. Web SearchBibTeXDownload
24Efficient Algorithms for Generalized Intersection Searching on Non-Iso-Oriented Objects. Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid. Symposium on Computational Geometry 1994, 369-378. Web SearchBibTeXDownload
1993
23Widest-corridor Problems. Ravi Janardan, Franco P. Preparata. CCCG 1993, 426-431. Web SearchBibTeX
22A fast algorithm for VLSI net extraction. Mario A. Lopez, Ravi Janardan, Sartaj K. Sahni. ICCAD 1993, 770-774. Web SearchBibTeXDownload
21Generalized intersection searching problems. Ravi Janardan, Mario A. Lopez. Int. J. Comput. Geometry Appl. (3): 39-69 (1993). Web SearchBibTeX
20On maintaining the width and diameter of a planar point-set online. Ravi Janardan. Int. J. Comput. Geometry Appl. (3): 331-344 (1993). Web SearchBibTeX
19Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization. Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid. WADS 1993, 361-372. Web SearchBibTeXDownload
1992
18Algorithms for Ray-Shooting and Intersection Searching. Siu-Wing Cheng, Ravi Janardan. J. Algorithms (13): 670-692 (1992). Web SearchBibTeXDownload
17Efficient Distributed Algorithms for Single-Source Shortest Paths and Related Problems on Plane Networks. Ravi Janardan, Siu-Wing Cheng. Mathematical Systems Theory (25): 93-122 (1992). Web SearchBibTeXDownload
16New Results on Dynamic Planar Point Location. Siu-Wing Cheng, Ravi Janardan. SIAM J. Comput. (21): 972-999 (1992). Web SearchBibTeXDownload
1991
15On the Dynamic Maintenance of Maximal Points in the Plane. Ravi Janardan. Inf. Process. Lett. (40): 59-64 (1991). Web SearchBibTeXDownload
14On Maintaining the Width and Diameter of a Planar Point-Set Online. Ravi Janardan. ISA 1991, 137-149. Web SearchBibTeXDownload
13Efficient Maintenance of the Union of Intervals on a Line, with Applications. Siu-Wing Cheng, Ravi Janardan. J. Algorithms (12): 57-74 (1991). Web SearchBibTeXDownload
12Space-efficient Ray-shooting and Intersection Searching: Algorithms, Dynamization, and Applications. Siu-Wing Cheng, Ravi Janardan. SODA 1991, 7-16. Web SearchBibTeXDownload
1990
11New Results on Dynamic Planar Point Location. Siu-Wing Cheng, Ravi Janardan. FOCS 1990, 96-105. Web SearchBibTeXDownload
10Efficient Dynamic Algorithms for Some Geometric Intersection Problems. Siu-Wing Cheng, Ravi Janardan. Inf. Process. Lett. (36): 251-258 (1990). Web SearchBibTeXDownload
9Space-Efficient Message Routing in c-Decomposable Networks. Greg N. Frederickson, Ravi Janardan. SIAM J. Comput. (19): 164-181 (1990). Web SearchBibTeXDownload
8Efficient Maintenance of the Union Intervals on a Line, with Applications. Siu-Wing Cheng, Ravi Janardan. SODA 1990, 74-83. Web SearchBibTeXDownload
7Efficient Distributed Algorithms for Single-Source Shortest Paths and Related Problems on Plane Networks. Ravi Janardan, Siu-Wing Cheng. WDAG 1990, 133-150. Web SearchBibTeXDownload
1989
6Efficient Message Routing in Planar Networks. Greg N. Frederickson, Ravi Janardan. SIAM J. Comput. (18): 843-857 (1989). Web SearchBibTeXDownload
1988
5Designing Networks with Compact Routing Tables. Greg N. Frederickson, Ravi Janardan. Algorithmica (3): 171-190 (1988). Web SearchBibTeXDownload
4Space-Efficient and Fault-Tolerant Message Routing in Outerplanar Networks. Greg N. Frederickson, Ravi Janardan. IEEE Trans. Computers (37): 1529-1540 (1988). Web SearchBibTeXDownload
1986
3Separator-Based Strategies for Efficient Message Routing (Preliminary Version). Greg N. Frederickson, Ravi Janardan. FOCS 1986, 428-437. Web SearchBibTeXDownload
2Optimal Message Routing without Complete Routing Tables (preliminary version). Greg N. Frederickson, Ravi Janardan. PODC 1986, 88-97. Web SearchBibTeX
1982
1A Public-Key Cryptosystem Based on the Matrix Cover NP-Complete Problem. Ravi Janardan, K. B. Lakshmanan. CRYPTO 1982, 21-37. Web SearchBibTeX
from DBLP and Google Scholar
Developed by the Database Group at the University of Wisconsin and Yahoo! Research