A classical theorem of Spencer shows that any set system with n sets and n elements admits a coloring of discrepancy O( √ n). Recent exciting work of Bansal, Lovett and Meka shows that such colorings can be found in polynomial time. In fact, the LovettMeka algorithm finds a half integral point in any “large enough” polytope. However, their algorithm crucially relies on the facet structure and d...

Diversely polarized antenna arrays are widely used in RF applications. The diverrity of rerponse provided b y such arrays can greatly improve direction finding performance over arrays sensitive to only one polarixation component. For d emitterr, direct implementation of a multidimensional estimation algorithm (e.g., maximum likelihood) requires a search f o r 3d parameters: d directions of arri...

Variational models with 1-norm based regularization, in particular total variation (TV) and its variants, have long been known to offer superior image restoration quality, but processing speed remained a bottleneck, preventing their widespread use in the practice of color image processing. In this paper, by extending the grayscale image deblurring algorithm proposed in [Y. Wang, J. Yang, W. Yin...

In this paper, we propose an unsupervised method for discovering inference rules from text, such as “X is author of Y ≈ X wrote Y”, “X solved Y ≈ X found a solution to Y”, and “X caused Y ≈ Y is triggered by X”. Inference rules are extremely important in many fields such as natural language processing, information retrieval, and artificial intelligence in general. Our algorithm is based on an e...

Chang, Y. -R. , Lin, H. -Y. , Chen, I. -Y. & Kuo, S. -Y. , A Cut-Based Algorithm for Reliability Analysis of Terminal-Pair Network Using OBDD, Proceedings of the 27th Annual International Conference on Computer Software and Applications, 2003. Fard, N. S. & Lee, T. -H. , Cutset enumeration of network systems with link and node failures, Reliability Engineering and System Safety 1999, pp. 141 14...

The widely adopted K-means clustering algorithm uses a sum of squared error objective function. A detailed analysis shows the close relationship between K-means clustering and principal component analysis (PCA) which is extensively utilized in unsupervised dimension reduction. We prove that the continuous solutions of the discrete K-means clustering membership indicators are the data projection...

In this paper we present a modiication of the CORDIC algorithm which reduces the number of iterations almost to half by merging two successive iterations of the basic algorithm. The two coeecients per iteration are obtained with only a small increase in the cycle time by estimating one of the coeecients. A correcting iteration method is used to correct the possible errors produced by the estima...

We say that X = [xij ]i,j=1 is symmetric centrosymmetric if xij = xji and xn−j+1,n−i+1, 1 ≤ i, j ≤ n. In this paper we present an efficient algorithm for minimizing ‖AXB + CY D − E‖ where ‖ · ‖ is the Frobenius norm, A ∈ Rt×n, B ∈ Rn×s, C ∈ Rt×m, D ∈ Rm×s, E ∈ Rt×s and X ∈ Rn×n is symmetric centrosymmetric with a specified central submatrix [xij ]r≤i,j≤n−r, Y ∈ Rm×m is symmetric with a specifie...

Let T [0..N −1] be an unsorted table of N items, each holding a value from an ordered set. For simplicity, assume that all values are distinct. The minimum searching problem is to find the index y such that T [y] is minimum. This clearly requires a linear number of probes on a classical probabilistic Turing machine. Here, we give a simple quantum algorithm which solves the problem using O( √ N)...

Let T [0..N−1] be an unsorted table of N items, each holding a value from an ordered set. For simplicity, assume that all values are distinct. The minimum searching problem is to find the index y such that T [y] is minimum. This clearly requires a linear number of probes on a classical probabilistic Turing machine. Here, we give a simple quantum algorithm which solves the problem using O( √ N )...