Browsing Division of Electrical, Electronics, and Computer Science (EECS) by Title
Now showing items 206-225 of 1710
-
Cluster Identification : Topic Models, Matrix Factorization And Concept Association Networks
(2013-09-17)The problem of identifying clusters arising in the context of topic models and related approaches is important in the area of machine learning. The problem concerning traversals on Concept Association Networks is of great ... -
Clustering For Designing Error Correcting Codes
(Indian Institute of Science, 2005-02-11)In this thesis we address the problem of designing codes for specific applications. To do so we make use of the relationship between clusters and codes. Designing a block code over any finite dimensional space may be thought ... -
Coaxial triggered vacum gap : switching and delay characteristics
Vacuum is an excellent insulator, albeit has a poorly defined intrinsic electric breakdown strength. Because of this, the ordinary vacuum gap with only two electrodes is unsuitable for switching applications. The electric ... -
Coded Caching in Multi-access Networks
Caching is a promising technique that can reduce the amount of data transmitted over latency-prone links, effectively trading affordable memory for expensive bandwidth resources. The frequently demanded content is stored ... -
CodeQueries: Benchmarking Query Answering over Source Code
Software developers often make queries about the security, performance effectiveness, and maintainability of their code. Through an iterative debugging process, developers analyze the code to find answers to these ... -
Codes closed under arbitrary abelian group of permutations
Discrete Fourier Transform (DFT) is a widely used tool in the field of electrical engineering. In the name of Mattson-Solomon polynomials, DFT was used in the context of linear cyclic codes in the early days of coding ... -
Codes for distributed storage, private information retrieval and low-latency streaming
This thesis presents results on error correcting codes for settings such as: (a) distributed storage, (b) private information retrieval, and (c) low-latency streaming. It also presents two new decoding algorithms for Polar ... -
Codes over galois rings closed under certain monomials
The use of error-control coding in information transmission systems and data storage systems is increasing rapidly. The primary aim of coding theorists has been to find “good codes” with “reasonably simple” decoding methods. ... -
Codes over galois rings closed under certain monomials
The use of error-control coding in information transmission systems and data storage systems is increasing rapidly. The primary aim of coding theorists has been to find “good codes” with “reasonably simple” decoding methods. ... -
Codes With Combined Locality and Regeneration Having Optimal Minimum Distance and Linear Field Size
This thesis presents error correcting codes in the setting of distributed storage. The codes presented in this thesis are optimal with respect to the minimum distance bound and have a finite field size which grows ... -
Codes With Locality For Distributed Data Storage
(2017-07-26)This thesis deals with the problem of code design in the setting of distributed storage systems consisting of multiple storage nodes, storing many different data les. A primary goal in such systems is the efficient repair ... -
Coding For Multi-Antenna Wireless Systems And Wireless Relay Networks
(2009-03-04)Communication over a wireless channel is a challenging task because of the inherent fading effects. Any wireless communication system employs some form of diversity improving techniques in order to improve the reliability ... -
Coding For Wireless Relay Networks And Mutiple Access Channels
(2011-07-12)This thesis addresses the design of low-complexity coding schemes for wireless relay networks and multiple access channels. The first part of the thesis is on wireless relay networks and the second part is on multiple ... -
Coding Schemes and Converse Bounds for Secure, Multi-Access, and Multi-Antenna Coded Caching Problems
With rapid advancements in technology, there is an increase in the adoption of data-hungry applications, especially entertainment services like on-demand music and video streaming and download. The high temporal variability ... -
Coding Schemes For Distributed Subspace Computation, Distributed Storage And Local Correctability
(2017-07-24)In this thesis, three problems have been considered and new coding schemes have been devised for each of them. The first is related to distributed function computation, the second to coding for distributed storage and the ... -
Coding Schemes for Secure and Reliable DNA-Based Data Storage
In DNA-based data storage, the desired information is encoded into the quaternary sequence of synthetic DNA molecules, called oligos. We look at secure communication via information-containing oligos in the usual three-party ... -
Coherent optical image deblurring with computer generated fourier plane filters
This thesis deals with the fabrication techniques of optical filters for use in a coherent optical processor for correcting images that are degraded by space-invariant blurs. In particular, techniques wherein one can utilize ... -
Combinatorial algorithms for determinant based problems
The thesis started with the early history and development of the theory of determinants. All the important results up to the 1880s were presented through a computing perspective. Pfaffians are closely related to determinants; ... -
Combinatorial Problems arising in Quantum Physics and Model counting
This thesis investigates some combinatorial problems arising in quantum physics and model counting. In particular, we develop new graph-theoretic techniques to resolve some open questions from quantum photonics. We also ...