431 |
N-tuple based image analysis using transputersBouridane, A. January 1992 (has links)
No description available.
|
432 |
On the integration of qualitative and quantitative methods in data fusionGao, Yang January 1994 (has links)
No description available.
|
433 |
Binaural influences on the response properties of neurones in the ferret inferior colliculusMcAlpine, David January 1994 (has links)
No description available.
|
434 |
Divided attention and the structure of temporary memoryTattersall, A. J. January 1987 (has links)
No description available.
|
435 |
Visual identification of fine surface incisionsSchenk, Veit U. B. January 2003 (has links)
No description available.
|
436 |
Gear condition monitoring by wavelet transform of vibration signalsLin, Shui-Town January 1996 (has links)
No description available.
|
437 |
An interference continuum for selective attention in vision : evidence from the attentional blinkMartin, Jesse January 2003 (has links)
No description available.
|
438 |
Some aspects seismic signal processing and analysisRoberts, G. January 1987 (has links)
No description available.
|
439 |
Efficient generalized transform algorithms for digital implementationMahdi, Abdul-Hussain Ebrahim January 1990 (has links)
No description available.
|
440 |
Task assignment in parallel processor systemsManoharan, Sathiamoorthy January 1993 (has links)
A generic object-oriented simulation platform is developed in order to conduct experiments on the performance of assignment schemes. The simulation platform, called Genesis, is generic in the sense that it can model the key parameters that describe a parallel system: the architecture, the program, the assignment scheme and the message routing strategy. Genesis uses as its basis a sound architectural representation scheme developed in the thesis. The thesis reports results from a number of experiments assessing the performance of assignment schemes using Genesis. The comparison results indicate that the new assignment scheme proposed in this thesis is a promising alternative to the work-greedy assignment schemes. The proposed scheme has a time-complexity less than those of the work-greedy schemes and achieves an average performance better than, or comparable to, those of the work-greedy schemes. To generate an assignment, some parameters describing the program model will be required. In many cases, accurate estimation of these parameters is hard. It is thought that inaccuracies in the estimation would lead to poor assignments. The thesis investigates this speculation and presents experimental evidence that shows such inaccuracies do not greatly affect the quality of the assignments.
|
Page generated in 0.0657 seconds