—We prove new lower bounds in the area of property testing of boolean functions. Specifically, we study the problem of testing whether a boolean function f is isomorphic to a ...
Dependency parsing is a central NLP task. In this paper we show that the common evaluation for unsupervised dependency parsing is highly sensitive to problematic annotations. We s...
Roy Schwartz, Omri Abend, Roi Reichart, Ari Rappop...
We show that the stick-breaking construction of the beta process due to Paisley et al. (2010) can be obtained from the characterization of the beta process as a Poisson process. S...
John William Paisley, David M. Blei, Michael I. Jo...
This paper addresses the problem of determining the node locations in ad-hoc sensor networks when only connectivity information is available. In previous work, we showed that the ...
The general problem of robust optimization is this: one of several possible scenarios will appear tomorrow, but things are more expensive tomorrow than they are today. What should...