M
Ming-Yang Kao
Researcher at Northwestern University
Publications - 202
Citations - 4582
Ming-Yang Kao is an academic researcher from Northwestern University. The author has contributed to research in topics: Time complexity & Planar graph. The author has an hindex of 37, co-authored 202 publications receiving 4438 citations. Previous affiliations of Ming-Yang Kao include Tufts University & Indiana University.
Papers
More filters
Proceedings ArticleDOI
Efficient submesh permutations in wormhole-routed meshes
Ching-Tien Ho,Ming-Yang Kao +1 more
TL;DR: It is shown that for d/spl les/2/spl alpha/+/spl beta/, concurrent independent permutations of n/sup /spl beta// related physical submeshes, each of /spl alpha/ dimensions, can be performed in two routing steps without congestion.
Proceedings Article
Designing proxies for stock market indices is computationally hard
Ming-Yang Kao,Stephen R. Tate +1 more
TL;DR: In this article, the authors study the problem of designing proxies (or portfolios) for various stock market indices based on historical data and show that the problem is NP-hard, and hence most likely intractable.
Posted Content
Linear-Time Approximation Algorithms for Computing Numerical Summation with Provably Small Errors
TL;DR: In this paper, it was shown that computing a polynomial-time approximation algorithm with a provably small worst-case error is NP-hard, even for the case of positive and negative numbers.
Posted Content
Optimal Bidding Algorithms Against Cheating in Multiple-Object Auctions
Ming-Yang Kao,Junfeng Qi,Lei Tan +2 more
TL;DR: An optimal randomized bidding algorithm is derived, by which the disadvantaged bidder can procure at least half of the auction objects despite the adversary's a priori knowledge of his algorithm.
Haplotype inference on pedigrees without recombinations
TL;DR: This paper presents a meta-modelling system that automates the very labor-intensive and therefore time-heavy and expensive and therefore expensive and expensive process of computer programming called “supervised learning”.