Browsing by Author Nandy, Subhas C

Jump to: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
or enter first few letters:  
Showing results 1 to 20 of 25  next >
Issue DateTitleAuthor(s)
2007Chromatic distribution of k-nearest neighbors of a line segment in a planar colored point setGoswami, Partha P; Das, Sandip; Nandy, Subhas C
2001Dynamically maintaining the widest k- dense corridorNandy, Subhas C; Harayama, Tomohiro; Asano, Tetsuo
1990Efficiency of discriminant analysis when initial samples are classifed stochasticallyKrishnan, T; Nandy, Subhas C
1990Efficiency of logistic-normal stochastic supervisionKrishnan, T; Nandy, Subhas C
Nov-2006Efficient algorithm for placing a given number of base stations to cover a convex regionDas, Gautam K; Das, Sandip; Nandy, Subhas C; Sinha, Bhabani P
Dec-1997Efficient algorithms for single- and two-layer linear placement of parallel graphsNandy, Subhas C; Nandakumar, G N; Bhattacharya, Bhargab B
1996Efficient computation of rectilinear geodesic voronoi neighbor in presence of obstaclesMitra, Pinaki; Nandy, Subhas C
2003An efficient k nearest neighbors searching algorithm for a query lineNandy, Subhas C; Das, Sandip; Goswami, Partha P
2003An efficient k nearest neighbours searching algorithm for a query lineNandy, Subhas C; Das, Sandip; Goswami, Partha P
2008A generalization of magic squares with applications to digital halftoningAronov, Boris; Asano, Tetsuo; Kikuchi, Yosuke; Nandy, Subhas C; Sasahara, Shinji; Uno, Takeaki
2007Improved algorithm for minimum cost range assignment problem for linear radio networksDas, Gautam K; Ghosh, S C; Nandy, Subhas C
2003Largest empty rectangle among a point setChaudhuri, J; Nandy, Subhas C; Das, S
2003Largest empty rectangle amopng a point setChaudhuri, J; Nandy, Subhas C; Das, Sandip
Aug-1998Maximal empty cuboids among points and blocksNandy, Subhas C; Bhattacharya, Bhargab B
2002Monotone bipartitioning problem ina planar point set with applications to VLSIDasgupta, P; Pan, P; Nandy, Subhas C; Bhattacharya, Bhargab B
Oct-2003On finding an empty stair case polygon of largest area (width) in a planar point-setNandy, Subhas C; Bhattacharya, Bhargab B
2003On finding an empty staircase plolygon of largest area (width) in a planer point setNandy, Subhas C; Bhattacharya, Bhargab B
2004Optimal algorithm for a special point labeling problemRoy, S; Goswami, Partha P; Das, Sandip; Nandy, Subhas C
2006Range assignment for energy efficient broadcasting in linear radio networksDas, Gautam K; Das, Sandip; Nandy, Subhas C
2000Safety zone problemNandy, Subhas C; Bhattacharya, Bhargab B; Hernandez barrera, H