EXPECTED TIME ANALYSIS OF A INTERPOLATION MERGE{A SIMPLE NEW MERGING ALGORITHM (2008)
The binary merging algorithm is the best general purpose merging algorithm known to date. Binary merge consists of two components: a rst component in which anarray index is incrementedbyanumber...
Visual Agent Programming (VAP): An Interactive System to Program Animated Agents (2008)
Abstract. An interactive system in which the user can program animated agents visually is introduced: the Visual Agent Programming (VAP) software provides a GUI to program life-like agents. VAP is...
3. Author: Miss Patcharaporn Panwong (2008)
Chairperson Dr, Vatcharaporn Esichaikul, Member Dr, Sumanta Guha
8. Expert Comments on the Work and Facility for the Feedback from the Users:-
2. Title INTELLIGENT COURSE RECOMMENDATION SYSTEM: AN ARTIFICIAL NEURAL NETWORK APPROACH (2008)
Cai Hui, Prof Peter, F. Haddawy, Dr. Sumanta Guha
Information Management 7. External Examiner (for Dissertations only) 8. Expert Comments on the Work and Facility for the Feedback from the Users 9. Abstract of the Work Academic advising is always a...
Expected Time Analysis Of A Interpolation Merge - A Simple New Merging Algorithm (2007)
this paper we formulate a simple algorithm called interpolation merge, where the binary search component is replaced with linear search, and analyze its expected behavior over data drawn from a...
Optimal Mesh Computer Algorithms for Simple Polygons (2007)
We present optimal parallel algorithms that run in O( p n) time on a p n \Theta p n mesh-connected computer for a number of fundamental problems concerning visibility and distance properties inside a...
Extreme Distances in Multicolored Point Sets (2007)
Adrian Dumitrescu Yz, Adrian Dumitrescu, Sumanta Guha
Given a set of n colored points in some d-dimensional Euclidean space, a bichromatic closest (resp. farthest) pair is a closest (resp. farthest) pair of points of dierent colors. We present ecient...
A Practical Algorithm for Integer Sorting on a Mesh-Connected Computer (Preliminary Version) (2006)
Guha, Sumanta, Folwell, Nathan, Suzuki, Ichiro
This paper presents count-sort, a parallel algorithm for mesh- connected computers to sort integers where the range of inputs is known. A straightforward counting technique that has not been...
Extreme Distances in Multicolored Point Sets (2003)
Adrian Dumitrescu, Sumanta Guha
Given a set of n coloredpointsinsomed-dimensional Euclidean space, a bichromatic closest (resp. farthest) pair is a closest (resp. farthest) pair of points of different colors. We present efficient...
Transforming Curves on Surfaces (1999)
We describe an optimal algorithm to decide if one closed curve on a triangulated 2-manifold can be continuously transformed to another, i.e., if they are homotopic. Suppose C 1 and C 2 are two closed...
Tamal K. Dey, Herbert Edelsbrunner, Sumanta Guha
The authors of this article believe there is or should be a research area appropriately referred to as computational topology. Its agenda includes the identification and formalization of topological...
Proximity Problems for Points on a Rectilinear Plane with Rectangular Obstacles, (1998)
We consider the following four problems for a set S of k points on a plane, equipped with the rectilinear metric and containing a set R of n disjoint rectangular obstacles (so that distance is...
New Approaches in Randomized Preprocessing for Motion Planning, (1998)
Guha, Sumanta, Puvvada, Rama D., Suri, Deepti, Suzuki, Ichiro
A powerful new method based on randomization has emerged recently with great success in robot motion planning. Firstly, this consists of preprocessing, in which valid configurations (nodes) of the...
Topology Preserving Edge Contraction (1998)
Tamal K. Dey, Herbert Edelsbrunner, Sumanta Guha, Dmitry V. Nekhayev
We study edge contractions in simplicial complexes and local conditions under which they preserve the topological type. The conditions are based on a generalized notion of boundary, which lends...
Computing Homology Groups of Simplicial Complexes in R³ (1998)
Tamal K. Dey, Sumanta Guha, In R
Recent developments in analyzing molecular structures and representing solid models using simplicial complexes have further enhanced the need for computing structural information about simplicial...
Algorithms for Manifolds and Simplicial Complexes in Euclidean 3-Space (1996)
Tamal K. Dey, Sumanta Guha, In R
A new approach to analyze simplicial complexes in Euclidean 3-space R 3 is described. First, methods from topology are used to analyze triangulated 3manifolds in R 3 . Then it is shown that these...
A Practical Algorithm for Integer Sorting on a MeshConnected Computer (1995)
Ichiro Suzuki z This paper presents count-sort, a parallel algorithm for mesh-connected computers to sort integers where the range of inputs is known. A straightforward counting technique that has...
Optimal Algorithms for Curves on Surfaces (1995)
We describe an optimal algorithm to decide if one closed curve on a triangulated 2-manifold can be continuously transformed to another, i.e., if they are homotopic. Our algorithm runs in O(n + k 1 +...
A Practical Algorithm for Integer Sorting on a Mesh-Connected Computer (1995)
Nathan Folwell Sumanta, Sumanta Guha
This paper presents count-sort, a parallel algorithm for mesh-connected computers to sort integers where the range of inputs is known. A straightforward counting technique that has not been...
PARALLEL ALGORITHMS FOR POLYGONAL AND RECTILINEAR GEOMETRY (POLYGONAL GEOMETRY). (1991)
Parallel algorithms are presented for geometric problems of two types: problems about simple polygons and problems dealing with the rectilinear metric.
A new derivation of the generating function for the major index (1990)
Guha, Sumanta, Padmanabhan, Sriram
We present a new proof of the well-known combinatorial result [nk]q = [Sigma]w qMaj(w) where w is a permutation of 0k1n-k, by showing a bijection between the set of partitions of an integer m that...
Proximity Problems For Points On A Rectilinear Plane With Rectangular Obstacles
We consider the following four problems for a set S of k points on a plane, equipped with the rectilinear metric and containing a set R of n disjoint rectangular obstacles (so that distance is...