Sciweavers

139 search results - page 1 / 28
» A Fast Algorithm for Computing the Euler Number of an Image ...
Sort
View
VLSID
2000
IEEE
164views VLSI» more  VLSID 2000»
13 years 9 months ago
A Fast Algorithm for Computing the Euler Number of an Image and its VLSI Implementation
Digital images are convenient media for describing and storing spatial, temporal, spectral, and physical components of information contained in a variety of domains(e.g. aerial/sa...
Sabyasachi Dey, Bhargab B. Bhattacharya, Malay Kum...
JPDC
2006
134views more  JPDC 2006»
13 years 4 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong
ICIP
2000
IEEE
14 years 6 months ago
A Fast Hierarchical Algorithm of Maximum Intensity Projection
The maximum intensity projection (MIP) is a useful tool to visualize 3D images. The processing time of the MIP depends on the number of voxels of the 3D data. Therefore, it is ver...
Keun Ho Kim, Min Jeong Kwon, Hyun Wook Park
ARITH
2011
IEEE
12 years 4 months ago
Fast Ripple-Carry Adders in Standard-Cell CMOS VLSI
— This paper presents a number of new high-radix ripple-carry adder designs based on Ling’s addition technique and a recently-published expansion thereof. The proposed adders a...
Neil Burgess
ISVLSI
2002
IEEE
104views VLSI» more  ISVLSI 2002»
13 years 9 months ago
Scalable VLSI Architecture for GF(p) Montgomery Modular Inverse Computation
Modular inverse computation is needed in several public key cryptographic applications. In this work, we present two VLSI hardware implementations used in the calculation of Montg...
Adnan Abdul-Aziz Gutub, Alexandre F. Tenca, &Ccedi...