Computer Science
Permanent URI for this collectionhttp://164.52.219.250:4000/handle/10263/16
Browse
15 results
Search Results
Item Dynamically maintaining the widest k- dense corridor(2001) Nandy, Subhas C; Harayama, Tomohiro; Asano, TetsuoItem An efficient k nearest neighbours searching algorithm for a query line(2003) Nandy, Subhas C; Das, Sandip; Goswami, Partha PItem 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 Maximal empty cuboids among points and blocks(1998-08) Nandy, Subhas C; Bhattacharya, Bhargab BItem 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 An efficient k nearest neighbors searching algorithm for a query line(2003) Nandy, Subhas C; Das, Sandip; Goswami, Partha PItem Safety zone problem(2000) Nandy, Subhas C; Bhattacharya, Bhargab B; Hernandez barrera, HItem Searching networks with unrestricted at costs(2001) Dasgupta, Partha Sarathi; Sen, A K; Nandy, Subhas C; Bhattacharya, Bhargab BItem Optimal algorithm for a special point labeling problem(2004) Roy, S; Goswami, Partha P; Das, Sandip; Nandy, Subhas C