— In this paper, we consider the standard state estimation problem over a congested packet-based network. The network is modeled as a queue with a single server processing the pa...
Michael Epstein, Abhishek Tiwari, Ling Shi, Richar...
Given an undirected graph G, the maximal planar subgraph problem is to determine a planar subgraph H of G such that no edge of G-H can be added to H without destroying planarity. P...
We consider discrete stochastic optimization problems where the objective function can only be estimated by a simulation oracle; the oracle is defined only at the discrete points....
This paper presents a decomposition method for efficiently constructing 1-norm Support Vector Machines (SVMs). The decomposition algorithm introduced in this paper possesses many d...
In this paper a new solution for the single sample problem in low resolution face recognition is proposed. The proposed solution uses an enhanced virtual pose generation method to...