#### Filter Results:

- Full text PDF available (5)

#### Publication Year

2011

2016

- This year (0)
- Last 5 years (1)
- Last 10 years (6)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

#### Organism

Learn More

- Ming Lam Leung, Yang Li, Shengyu Zhang
- TAMC
- 2011

We study the communication complexity of symmetric XOR functions, namely functions f : {0, 1}×{0, 1} → {0, 1} that can be formulated as f(x, y) = D(|x⊕ y|) for some predicate D : {0, 1, ..., n} → {0, 1}, where |x⊕ y| is the Hamming weight of the bitwise XOR of x and y. We give a public-coin randomized protocol in the Simultaneous Message Passing (SMP)… (More)

- Ming Lam Leung, Yang Li, Shengyu Zhang
- Electronic Colloquium on Computational Complexity
- 2011

We study the communication complexity of symmetric XOR functions, namely functions f : {0, 1}×{0, 1} → {0, 1} that can be formulated as f(x, y) = D(|x⊕ y|) for some predicate D : {0, 1, ..., n} → {0, 1}, where |x⊕ y| is the Hamming weight of the bitwise XOR of x and y. We give a public-coin randomized protocol in the Simultaneous Message Passing (SMP)… (More)

- Ming Lam Leung
- ArXiv
- 2011

This paper unifies the concepts of evolutionary games and quantum strategies. First, we state the formulation and properties of classical evolutionary strategies, with focus on the destinations of evolution in 2-player 2strategy games. We then introduce a new formalism of quantum evolutionary dynamics, and give an example where an evolving quantum strategy… (More)

- Haizhou Wang, Ming Lam Leung, Angela Wandinger-Ness, Laurie G . Hudson, Mingzhou Song
- IET systems biology
- 2016

Integrating prior molecular network knowledge into interpretation of new experimental data is routine practice in biology research. However, a dilemma for deciphering interactome using Bayes' rule is the demotion of novel interactions with low prior probabilities. Here the authors present constrained generalised logical network (CGLN) inference to predict… (More)

- Ming Lam Leung
- ArXiv
- 2011

The firefighter problem is defined as below. A fire initially breaks out at a vertex r on a graph G. In each step, a firefighter chooses to protect one vertex, which is not yet burnt. And the fire spreads out to its unprotected neighboring vertices afterwards. The objective of the problem is to choose a sequence of vertices to protect, in order to save… (More)

In this thesis we extend the recent algebraic approach to design fast algorithms for two problems in combinatorial optimization. First we study the linear matroid parity problem, a common generalization of graph matching and linear matroid intersection, that has applications in various areas. We show that Harvey’s algorithm for linear matroid intersection… (More)

- ‹
- 1
- ›