A new deterministic broadcast protocol for an ad hoc network is proposed in this paper which avoids re-computation of the transmission schedule, even when the topology of the network changes due to the mobility of the...
详细信息
Finding the location of an object, other than the sensor in a sensor network is an important problem. There is no good technique available in the literature to find the location of objects. We propose a technique to f...
详细信息
Fast and robust fingerprint matching is a challenging task today in fingerprint-based biometric systems. A fingerprint matching algorithm compares two given fingerprints and returns either a degree of similarity or a ...
详细信息
Fast and robust fingerprint matching is a challenging task today in fingerprint-based biometric systems. A fingerprint matching algorithm compares two given fingerprints and returns either a degree of similarity or a binary decision. Minutiae-based fingerprint matching is the most well-known and widely used method. This paper reveals a new technique of fingerprint matching, using an efficient data structure, combining the minutiae representation with the individual usefulness of each minutia, to make the matching more powerful. Experimental results exhibit the strength of this method.
This paper presents an algorithm for identifying a maximal empty-staircase-polygon (MESP) of largest area, among a set of n points on a rectangular floor. A staircase polygon is an isothetic polygon bounded by two mon...
详细信息
There are several schemes for checkpointing and rollback recovery. In this paper, we analyze some such schemes under a stochastic model. We have found expressions for average cost of checkpointing, rollback recovery, ...
详细信息
Given a hexagonal cellular network with specific demand Vector and frequency separation constraints, we introduce the concept of a critical block of the network, that leads us to an efficient channel assignment scheme...
详细信息
Given a hexagonal cellular network with specific demand Vector and frequency separation constraints, we introduce the concept of a critical block of the network, that leads us to an efficient channel assignment scheme for the whole network. A novel idea of partitioning the critical block into several smaller sub-networks with homogeneous demands has been introduced which provides an elegant way of assigning frequencies to the critical block. This idea of partitioning is then extended for assigning frequencies to the rest of the network. The proposed algorithm provides an optimal assignment for all well-known benchmark instances including the most difficult two. It is shown to be superior to the existing frequency assignment algorithms, reported so far, in terms of both bandwidth requirement and computation time.
暂无评论