Search
Skip to Search Results- 2Abdi Oskouie, Mina
- 2Birkbeck, Neil Aylon Charles
- 2Cai, Zhipeng
- 2Chen, Jiyang
- 2Chowdhury, Md Solimul
- 2Chubak, Pirooz
- 74Machine Learning
- 70Reinforcement Learning
- 41Artificial Intelligence
- 36Machine learning
- 22Natural Language Processing
- 22Reinforcement learning
-
Spring 2011
The minimum degree spanning tree problem is a widely studied NP-hard variation of the minimum spanning tree problem, and a generalization of the Hamiltonian path problem. Most of the work done on the minimum degree spanning tree problem has been on approximation algorithms, and very little work...
-
Fall 2021
Application Programming Interfaces (APIs) allow developers to reuse existing functionality without knowing the implementation details. However, developers might make mistakes in using APIs, which are known as API misuses. One way to detect and prevent API misuses is to encode usage specifications...
-
Spring 2013
We propose a two-phase method, called Multivariate Association Discovery (MAD), to mine temporal associations in multiple event sequences. It is assumed that a set of event sequences has been collected from an application, where each event has an id and an occurrence time. The goal is to detect...
-
Fall 2011
High-throughput single nucleotide polymorphism (SNP) genotyping technologies conveniently produce large SNP genotype datasets for genome-wide linkage and association studies. Various factors, from array design and hybridization, can give rise to a certain percentage of missing calls, and the...
-
Mixed Low-bit Quantization for Model Compression with Layer Importance and Gradient Estimations
DownloadSpring 2022
Deep neural networks (DNNs) have been widely used in the modern world in recent years. However, due to the substantial memory consumption and high computational power use of DNNs, deploying them on devices with limited resources is challenging. Model compression methods can provide us with a...