14 citations · 51 across the 10 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.DS2019
Spectral Lower Bounds on the I/O Complexity of Computation Graphs
Saachi Jain, Matei Zaharia
We consider the problem of finding lower bounds on the I/O complexity of arbitrary computations in a two level memory hierarchy. Executions of complex computations can be formalize…
cs.CL2019
Learning to Speak and Act in a Fantasy Text Adventure Game
Jack Urbanek, Angela Fan, Siddharth Karamcheti +7
We introduce a large scale crowdsourced text adventure game as a research platform for studying grounded dialogue. In it, agents can perceive, emote, and act whilst conducting dial…