5100 search results - page 872 / 1020 » The Linear Complexity of a Graph |
129
click to vote
ICCAD
2000
IEEE
15 years 9 months ago
2000
IEEE
In this paper, we propose a novel fault-oriented test generation methodology for detection and isolation of faults in analog circuits. Given the description of the circuit-underte...
144
click to vote
ICCAD
2000
IEEE
15 years 9 months ago
2000
IEEE
In this paper, we propose an approach for the analysis of power supply noise in the frequency domain for power/ground (P/G) networks of tree topologies. We model the P/G network a...
145
click to vote
IPPS
2000
IEEE
15 years 9 months ago
2000
IEEE
Consider any known sequential algorithm for matrix multiplication over an arbitrary ring with time complexity O N , where 2 3. We show that such an algorithm can be parallelize...
174
click to vote
SCCC
2000
IEEE
15 years 9 months ago
2000
IEEE
Knowledge discovery is the most desirable end product of an enterprise information system. Researches from different areas recognize that a new generation of intelligent tools for...
141
click to vote
VISUALIZATION
2000
IEEE
15 years 9 months ago
2000
IEEE
We present two beneficial rendering extensions to the Projected Tetrahedra (PT) algorithm by Shirley and Tuchman. These extensions are compatible with any cell sorting technique,...