#### Filter Results:

- Full text PDF available (95)

#### Publication Year

1972

2017

- This year (3)
- Last 5 years (16)
- Last 10 years (38)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Brain Region

#### Cell Type

#### Method

#### Organism

Learn More

- Zhichun Li, Manan Sanghi, Yan Chen, Ming-Yang Kao, Brian Chavez
- 2006 IEEE Symposium on Security and Privacy (S&P…
- 2006

Zero-day polymorphic worms pose a serious threat to the security of Internet infrastructures. Given their rapid propagation, it is crucial to detect them at edge networks and automatically generate… (More)

In this paper, we extend Rothemund and Winfree's examination of the tile complexity of tile self-assembly [6]. They provided a lower bound of Ω(log <i>N</i>/log log <i>N</i>) on the tile… (More)

- Ting Chen, Ming-Yang Kao, Matthew Tepel, John Rush, George M. Church
- Journal of Computational Biology
- 2000

Tandem mass spectrometry fragments a large number of molecules of the same peptide sequence into charged molecules of prefix and suffix peptide subsequences and then measures mass/charge ratios of… (More)

- Robert T. Schweller, Zhichun Li, +6 authors Gokhan Memik
- IEEE/ACM Transactions on Networking
- 2007

A key function for network traffic monitoring and analysis is the ability to perform aggregate queries over multiple data streams. Change detection is an important primitive which can be extended to… (More)

- Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao
- J. Comput. Syst. Sci.
- 2004

In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguished” by a family of… (More)

- Joseph Cheriyan, Ming-Yang Kao, Ramakrishna Thurimella
- SIAM J. Comput.
- 1993

In the load balancing problem, there is a set of servers, and jobs arrive sequentially. Each job can be run on some subset of the servers, and must be assigned to one of them in an online fashion.… (More)

- Ming-Yang Kao, Philip N. Klein
- STOC
- 1990

1. I n t roduc t i on . In its simpliest form, the di. graph reachability problem is to test whether a graph contains a directed path from a given vertex to another. The best sequential algorithms… (More)

- Richie Chih-Nan Chuang, Ashim Garg, Xin He, Ming-Yang Kao, Hsueh-I Lu
- ICALP
- 1998

We consider the problem of coding planar graphs by binary strings. Depending on whether O(1)-time queries for adjacency and degree are supported, we present three sets of coding schemes which all… (More)

- Ming-Yang Kao
- 2006

Let G be a bipartite graph with positive integer weights on the edges and without isolated nodes. Let n, N and W be the node count, the largest edge weight and the total weight of G. Let k(x, y) be… (More)