Skip navigation
Home
Browse
Communities
& Collections
Browse Items by:
Issue Date
Author
Title
Subject
Help
Sign on to:
My DSpace
Receive email
updates
Edit Profile
DSpace
JSPUI
DSpace preserves and enables easy and open access to all types of digital content including text, images, moving images, mpegs and data sets
Learn More
DSpace at Indian Statistical Institute
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:
Sort by:
title
issue date
submit date
In order:
Ascending
Descending
Results/Page
5
10
15
20
25
30
35
40
45
50
55
60
65
70
75
80
85
90
95
100
Authors/Record:
All
1
5
10
15
20
25
30
35
40
45
50
Showing results 1 to 20 of 25
next >
Issue Date
Title
Author(s)
2007
Chromatic distribution of k-nearest neighbors of a line segment in a planar colored point set
Goswami, Partha P
;
Das, Sandip
;
Nandy, Subhas C
2001
Dynamically maintaining the widest k- dense corridor
Nandy, Subhas C
;
Harayama, Tomohiro
;
Asano, Tetsuo
1990
Efficiency of discriminant analysis when initial samples are classifed stochastically
Krishnan, T
;
Nandy, Subhas C
1990
Efficiency of logistic-normal stochastic supervision
Krishnan, T
;
Nandy, Subhas C
Nov-2006
Efficient algorithm for placing a given number of base stations to cover a convex region
Das, Gautam K
;
Das, Sandip
;
Nandy, Subhas C
;
Sinha, Bhabani P
Dec-1997
Efficient algorithms for single- and two-layer linear placement of parallel graphs
Nandy, Subhas C
;
Nandakumar, G N
;
Bhattacharya, Bhargab B
1996
Efficient computation of rectilinear geodesic voronoi neighbor in presence of obstacles
Mitra, Pinaki
;
Nandy, Subhas C
2003
An efficient k nearest neighbors searching algorithm for a query line
Nandy, Subhas C
;
Das, Sandip
;
Goswami, Partha P
2003
An efficient k nearest neighbours searching algorithm for a query line
Nandy, Subhas C
;
Das, Sandip
;
Goswami, Partha P
2008
A generalization of magic squares with applications to digital halftoning
Aronov, Boris
;
Asano, Tetsuo
;
Kikuchi, Yosuke
;
Nandy, Subhas C
;
Sasahara, Shinji
;
Uno, Takeaki
2007
Improved algorithm for minimum cost range assignment problem for linear radio networks
Das, Gautam K
;
Ghosh, S C
;
Nandy, Subhas C
2003
Largest empty rectangle among a point set
Chaudhuri, J
;
Nandy, Subhas C
;
Das, S
2003
Largest empty rectangle amopng a point set
Chaudhuri, J
;
Nandy, Subhas C
;
Das, Sandip
Aug-1998
Maximal empty cuboids among points and blocks
Nandy, Subhas C
;
Bhattacharya, Bhargab B
2002
Monotone bipartitioning problem ina planar point set with applications to VLSI
Dasgupta, P
;
Pan, P
;
Nandy, Subhas C
;
Bhattacharya, Bhargab B
Oct-2003
On finding an empty stair case polygon of largest area (width) in a planar point-set
Nandy, Subhas C
;
Bhattacharya, Bhargab B
2003
On finding an empty staircase plolygon of largest area (width) in a planer point set
Nandy, Subhas C
;
Bhattacharya, Bhargab B
2004
Optimal algorithm for a special point labeling problem
Roy, S
;
Goswami, Partha P
;
Das, Sandip
;
Nandy, Subhas C
2006
Range assignment for energy efficient broadcasting in linear radio networks
Das, Gautam K
;
Das, Sandip
;
Nandy, Subhas C
2000
Safety zone problem
Nandy, Subhas C
;
Bhattacharya, Bhargab B
;
Hernandez barrera, H