Northwest Probability Seminar – Session 1
The local max-cut problem asks to find a partition of the vertices in a weighted graph such that the cut weight cannot be improved by moving a single vertex (that is the partition is locally…
The local max-cut problem asks to find a partition of the vertices in a weighted graph such that the cut weight cannot be improved by moving a single vertex (that is the partition is locally…
The local max-cut problem asks to find a partition of the vertices in a weighted graph such that the cut weight cannot be improved by moving a single vertex (that is the partition is locally…
The 18th Northwest Probability Seminar, a one-day mini-conference organized by the University of Washington, the Oregon State University, the University of British Columbia, the University of Oregon, and the Theory Group at Microsoft Research, will be…
In a free market, the rise or fall of a price signals excess demand or supply. If the dynamics of price adjustment work well, signaling can enable goods to clear and prices to equilibrate. This…
Abstract: Parsing accuracy is greatly impacted by the quality of preprocessing steps such as part-of-speech (POS) tagging, word segmentation and morphological analysis. While prior researches have successfully demonstrated that joint modeling alleviates error propagation in…
Spatial reaction-diffusion models have been employed to describe many emergent phenomena in biological systems. The modelling technique most commonly adopted in the literature implements systems of partial differential equations (PDEs), which assumes there are sufficient…
A central theme in mechanism design is understanding the tradeoff between simplicity and optimality of the designed mechanism. An important and challenging task here is to design simple multi-item mechanisms that can approximately optimize the…