Browsing Computer Science and Engineering by Issue Date
Now showing items 120 of 89

Faulttolerant analysis and algorithms for a proposed augmented binary tree architecture
(1989)An augmented binary (AB) tree architecture is proposed with a view to providing fault tolerance. This architecture is an augmentation of an nlevel full binary tree with n redundant nodes and 2 n+3n6 redundant links. The ... 
Object recognition based on indexing in 2D environment
(1991)Modelbased objact recognition has attracted considerable attention in the vision community over the last twenty years. This paper prasents a model based two dimensional object recognition system using feature indexing ... 
Planar graph coloring is not selfreducible, assuming P ≠ NP
(1991)We show that obtaining the lexicographically first four coloring of a planar graph is NPhard. This shows that planar graph fourcoloring is not selfreducible, assuming P≠ NP. One consequence of our result is that the ... 
Data path synthesis with global time constraint
(1992)This paper presents an algorithm and its implementation for performing scheduling and operator allocation for data path synthesis. The main advantage of this approach is that it is capable of handling global time constraint ... 
A expert system for aid in material selection process
(1993)An expert system for aiding material selection process is proposed which, in conjunction with TOPSIS (Technique for Order Preference by Similarity to Ideal Situation), provides a very effective and efficient technique for ... 
Improved bounds for the maxflow minmulticut ratio for planar and Kr, rfree graphs
(1993)We consider the version of the multicommodity flow problem in which the objective is to maximize the sum of commodities routed. Garg, Vazirani and Yannakakis proved that the minimum multicut and maximum flow ratio for this ... 
A expert system for aid in material selection process
(1993)An expert system for aiding material selection process is proposed which, in conjunction with TOPSIS (Technique for Order Preference by Similarity to Ideal Situation), provides a very effective and efficient technique for ... 
Online algorithms for weighted bipartite matching and stable marriages
(1994)We give an online deterministic algorithm for the weighted bipartite matching problem that achieves a competitive ratio of (2n−1) in any metric space (where n is the number of vertices). This algorithm is optimal  there ... 
FAST: FPGA targeted RTL structure synthesis technique
(1994)Presents an approach for mapping RTL structures onto FPGAs. This is in contrast to other FPGA mapping techniques which start from Boolean networks. Each component part consists of singlebit or multibit slice of one or ... 
An empirical evaluation of virtual circuit holding times in IPoverATM networks
(1994)When carrying Internet Protocol (IP) traffic over an asynchronous transfer mode (ATM) network, the ATM adaptation layer must determine how long to hold a virtual circuit opened to carry an IP datagram. The authors present ... 
Finding nonfaulty subtrees in faulty binary tree architectures
(1994)In this paper we have studied fault tolerance of a full binary tree in terms of availability of nonfaulty (full) subtrees. When an unaugmented full binary tree is faulty, then the computation can be carried out on the ... 
Design of a kernel for implementing communication protocols
(1995)We describe the design of a kernel for an inexpensive frontend processor to run the lower layers of common communication protocols. Implementing a full fledged kernel on a card requires large memory, expensive hardware ... 
An Efficient OutputSensitive HiddenSurface Removal Algorithm for Polihedral Terrains*
(1995)In this paper, we present an algorithm for hidden surface removal for a class of polyhedral surfaces which have a property that they can be ordered relatively quickly. For example, our results apply directly to terrain ... 
Circuit partitioning with partial order for mixed simulation emulation environment
(1995)A lowcost hybrid simulator for VLSI circuits has been under development at IIT Delhi. The simulator uses a Reconfigurable System (RS) consisting of a limited number of FPGAs for hardware emulation and blends the ideas of ... 
Model based object recognition — the role of affine invariants
(1996)This paper proposes an efficient method to recognize rigid flat objects from its intensity images which are assumed to be arbitrarily positioned in space. The task of the recognition method is to find instances of known ... 
Selection in monotone matrices and computing kth nearest neighbors
(1996)An m x n matrix A=(ai j),1,i,m and 1,j<n is called a totally motone matrix if for i1.i2.j1.j2satisfying1=i1.i2.m1=j1.j2.n ai1.ji1<ai1.j2=ai2j1<ai2.j2.We present an O ((m+n)nlogn time algorithm to select the kth smallest ... 
A linear time algorithm for the Bottleneck Biconnected Spanning Subgraph problem
(1996)A linear time algorithm for the Bottleneck Biconnected Spanning Subgraph problem is presented. This improves theb hitherto bestknown solution, which has a running time of 0( m + n log n), where m and n are the number of ... 
Transparent parallel replication of logically partitioned databases
(1996)This paper presents a protocol for efficient transaction management in an environment of replicated autonomous databases. Each replicated copy has ownership over mutually exclusive portions of the database. The protocol ... 
AnO(n) Algorithm for AbelianpGroup Isomorphism and anO(n log n) Algorithm for Abelian Group Isomorphism
(1996)The isomorphism problem for groups is to determine whether two finite groups are isomorphic. The groups are assumed to be epresented by their multiplication tables. Tarjan has shown that this problem can bedone in time ... 
An integrated approach for range image segmentation and representation
(1996)This paper proposes an efficient method for the segmentation and representation of 3D rigid, solid objects from its range images using differential invariants derived from classical differential geometry. An efficient ...