Search
Now showing items 11-19 of 19
A theoretical comparison of four parallel processing networks /
(1984)
Previous work on the analysis of execution time of parallel algorithms has either largely ignored communication delays or has dealt with specific interconnection structures such as the perfect shuffle and the nearest ...
IMAGE AND VIDEO ENHANCEMENT USING SPARSE CODING, BELIEF PROPAGATION AND MATRIX COMPLETION
(2014-12-01)
Super resolution as an exciting application in image processing was studied widely
in the literature. This dissertation presents new approaches to video super resolution,
based on sparse coding and belief propagation. ...
Formal specification of operations on a class of syntactically-specified data structures.
(1982)
To illustrate the theory, a transform statement syntax is developed, and an interpreter is used to demonstrate operations on several types of structures. The work documented herein is a potential basis for an advanced data ...
Coverage issues in wireless sensor networks.
(2006)
A fundamental issue in the deployment of a large scale Wireless Sensor Network (WSN) is the ability of the network to cover the region of interest. While it is important to know if the region is covered by the deployed ...
Graph models and system diagnosis.
(1997)
The connectivity of a system is an important measure of fault tolerance. Typical interconnection networks are sparse and symmetrical. The classical diagnosis theories, such as t-diagnosability, are not appropriate for these ...
Inference control in statistical databases :
(1983)
An efficient and effective data distortion technique is introduced. This "Probability Data Distortion, " which is not easily compromisable and has asymptotically the same statistical properties as the original data, is ...
Study of interconnection networks /
(1985)
A multi-stage N x N interconnection network is said to be universal if it realizes the set of all permutations on N objects. A new bound on the number of stages required for the universality of shuffle-exchange network as ...
Scheduling periodic-time-critical tasks on multiprocessor computing systems /
(1985)
The problem of allocating a set of periodic-time-critical tasks to processors in a multiprocessor system is considered. A periodic-time-critical task consists of a certain number of requests, arising periodically, each of ...