This paper describes novel results on the characteristics of three-party dialogues by quantitatively comparing them with those of two-party. In previous dialogue research, two-par...
—We study the one-way number-on-the-forhead (NOF) communication complexity of the k-layer pointer jumping problem. Strong lower bounds for this problem would have important impli...
We re-visit the problem of secure multiparty set intersection in information theoretic settings. In [16], Li et.al have proposed a protocol for multiparty set intersection problem...
In this paper, we describe our experience with collecting and creating an annotated corpus of multi-party online conversations in a chat-room environment. This effort is part of a...
—With the increase in cheap commercially available sensors, recording meetings is becoming an increasingly practical option. With this trend comes the need to summarize the recor...
Hayley Hung, Yan Huang, Gerald Friedland, Daniel G...