Capybara: μSecond-Scale Live TCP Migration by Choi, Inho, Wadekar, Nimish, Joshi, Raj, Fried, Joshua, Ports, Dan R. K., Zhang, Irene, Li, Jialin

Get full text

Wait-Learning: Leveraging Wait Time for Second Language Education by Cai, Carrie Jun, Guo, Philip J, Glass, James R, Miller, Robert C

“…In this paper, we explore wait-learning: leveraging brief moments of waiting during a person's existing conversations for second language vocabulary practice, even if the conversation happens in the native language. …”
Get full text
Get full text
Get full text
Get full text

Crowds in two seconds: Enabling realtime crowd-powered interfaces by Bernstein, Michael S., Brandt, Joel, Miller, Robert C., Karger, David R.

“…We develop techniques that recruit synchronous crowds in two seconds and use them to execute complex search tasks in ten seconds. …”
Get full text
Get full text
Get full text

Wait-learning: Leveraging conversational dead time for second language education by Guo, Philip J., Miller, Robert C., Cai, Carrie Jun, Glass, James R.

“…Second-language learners are often unable to find time for language practice due to constraints in their daily lives. …”
Get full text
Get full text
Get full text
Get full text

From Human Days to Machine Seconds: Automatically Answering and Generating Machine Learning Final Exams by Drori, Iddo, Zhang, Sarah, Shuttleworth, Reece, Zhang, Sarah, Tyser, Keith, Chin, Zad, Lantigua, Pedro, Surbehera, Saisamrit, Hunter, Gregory, Austin, Derek, Tang, Leonard, Hicke, Yann, Simhon, Sage, Karnik, Sathwik, Granberry, Darnell, Udell, Madeleine

Get full text

Linux Kernel Vulnerabilities: State-of-the-Art Defenses and Open Problems by Chen, Haogang, Mao, Yandong, Wang, Xi, Zhou, Dong, Zeldovich, Nickolai, Kaashoek, M. Frans

“…First, this paper presents data on 141 Linux kernel vulnerabilities discovered from January 2010 to March 2011, and second, this paper examines how well state-of-the-art techniques address these vulnerabilities. …”
Get full text
Get full text
Get full text
Get full text

Company-Coq: Taking Proof General one step closer to a real IDE by Pit-Claudel, Clement F., Courtieu, Pierre

Get full text
Get full text

Company-Coq: Taking Proof General one step closer to a real IDE by Pit-Claudel, Clément, Courtieu, Pierre

Get full text
Get full text

Property Testing via Set-Theoretic Operations by Chen, Victor, Sudan, Madhu, Xie, Ning

Get full text

The Voronoi game on graphs and its complexity by Teramoto, Sachio, Demaine, Erik D, Uehara, Ryuhei

“…Even for the one-round case in which the strategy adopted by the first player consist of a fixed single node, deciding whether the second player can win is NP-complete. We also show that deciding whether the second player can win is PSPACE-complete in general.…”
Get full text

Retroactive auditing by Wang, Xi, Zeldovich, Nickolai, Kaashoek, M. Frans

Get full text
Get full text
Get full text

The Voronoi game on graphs and its complexity by Teramoto, Sachio, Demaine, Erik D., Uehara, Ryuhei

“…Even for the one-round case in which the strategy adopted by the first player consist of a fixed single node, deciding whether the second player can win is NP-complete. We also show that deciding whether the second player can win is PSPACE-complete in general.…”
Get full text
Get full text

Predicting Native Language from Gaze by Berzak, Yevgeni, Shikanai, Chie, Flynn, Suzanne, Katz, Boris

“…A fundamental question in language learning concerns the role of a speaker’s first language in second language acquisition. We present a novel methodology for studying this question: analysis of eye-movement patterns in second language reading of free-form text. …”
Get full text
Get full text
Get full text
Get full text

On the complexity of approximating a nash equilibrium by Daskalakis, Constantinos

Get full text
Get full text

Continuous local search by Daskalakis, Constantinos, Papadimitriou, Christos

Get full text
Get full text

Tight Revenue Bounds With Possibilistic Beliefs and Level-k Rationality by Chen, Jing, Micali, Silvio, Pass, Rafael

“…Specifically, • We define a sequence of monotonically increasing revenue benchmarks for single-good auctions, G[superscript 0≤]G[superscript 1≤]G[superscript 2≤]···,where each G[superscript i] is defined over the players’ beliefs and G[superscript 0] is the second-highest valuation (i.e., the revenue benchmark achieved by the second-price mechanism)…”
Get full text
Get full text

Efficient Money Burning in General Domains by Fotakis, Dimitris, Tsipras, Dimitris, Tzamos, Christos, Zampetakis, Emmanouil

“…The first mechanism achieves an O(logm)-approximation to the social surplus, which is improved to an O(1)-approximation by the second mechanism. An interesting feature of the second mechanism is that it optimizes over an appropriately restricted space of probability distributions, thus achieving an efficient tradeoff between social surplus and the total amount of payments charged to the agents.…”
Get full text
Get full text
Get full text
Get full text

Learning the probability of activation in the presence of latent spreaders by Makar, Maggie, Guttag, John V, Wiens, Jenna

Get full text

Assessing Language Proficiency from Eye Movements in Reading by Berzak, Yevgeni, Katz, Boris, Levy, Roger P

“…We present a novel approach for determining learners' second language proficiency which utilizes behavioral traces of eye movements during reading. …”
Get full text

Evolutionary trees and the Ising model on the Bethe lattice: a proof of Steel’s conjecture by Daskalakis, Constantinos, Mossel, Elchanan, Roch, Sébastien

“…Steel’s conjecture was proven by the second author in the special case where the tree is “balanced.” …”
Get full text