Browsing by Author "Nandy, Subhas C"
Now showing 1 - 20 of 25
- Results Per Page
- Sort Options
Item Chromatic distribution of k-nearest neighbors of a line segment in a planar colored point set(2007) Goswami, Partha P; Das, Sandip; Nandy, Subhas CItem Dynamically maintaining the widest k- dense corridor(2001) Nandy, Subhas C; Harayama, Tomohiro; Asano, TetsuoItem Efficiency of discriminant analysis when initial samples are classifed stochastically(1990) Krishnan, T; Nandy, Subhas CItem Efficiency of logistic-normal stochastic supervision(1990) Krishnan, T; Nandy, Subhas CItem Efficient algorithm for placing a given number of base stations to cover a convex region(2006-11) Das, Gautam K; Das, Sandip; Nandy, Subhas C; Sinha, Bhabani PItem Efficient algorithms for single- and two-layer linear placement of parallel graphs(1997-12) Nandy, Subhas C; Nandakumar, G N; Bhattacharya, Bhargab BItem Efficient computation of rectilinear geodesic voronoi neighbor in presence of obstacles(1996) Mitra, Pinaki; Nandy, Subhas CItem An efficient k nearest neighbors searching algorithm for a query line(2003) Nandy, Subhas C; Das, Sandip; Goswami, Partha PItem An efficient k nearest neighbours searching algorithm for a query line(2003) Nandy, Subhas C; Das, Sandip; Goswami, Partha PItem A generalization of magic squares with applications to digital halftoning(2008) Aronov, Boris; Asano, Tetsuo; Kikuchi, Yosuke; Nandy, Subhas C; Sasahara, Shinji; Uno, TakeakiItem Improved algorithm for minimum cost range assignment problem for linear radio networks(2007) Das, Gautam K; Ghosh, S C; Nandy, Subhas CItem Largest empty rectangle among a point set(2003) Chaudhuri, J; Nandy, Subhas C; Das, SItem Largest empty rectangle amopng a point set(2003) Chaudhuri, J; Nandy, Subhas C; Das, SandipItem Maximal empty cuboids among points and blocks(1998-08) Nandy, Subhas C; Bhattacharya, Bhargab BItem Monotone bipartitioning problem ina planar point set with applications to VLSI(2002) Dasgupta, P; Pan, P; Nandy, Subhas C; Bhattacharya, Bhargab BItem On finding an empty stair case polygon of largest area (width) in a planar point-set(2003-10) Nandy, Subhas C; Bhattacharya, Bhargab BItem On finding an empty staircase plolygon of largest area (width) in a planer point set(2003) Nandy, Subhas C; Bhattacharya, Bhargab BItem Optimal algorithm for a special point labeling problem(2004) Roy, S; Goswami, Partha P; Das, Sandip; Nandy, Subhas CItem Range assignment for energy efficient broadcasting in linear radio networks(2006) Das, Gautam K; Das, Sandip; Nandy, Subhas CItem Safety zone problem(2000) Nandy, Subhas C; Bhattacharya, Bhargab B; Hernandez barrera, H