ion can improve performance without significantly breaking layered abstractions; explicit bursts are preferable to steady, constant bitrate traffic. Furthermore, the vagaries and c...
The objective of this work is to automatically detect the use of game bots in online games based on the trajectories of account users. Online gaming has become one of the most popu...
Mobile applications are becoming increasingly ubiquitous and provide ever richer functionality on mobile devices. At the same time, such devices often enjoy strong connectivity wi...
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...
—At ICSE 2010, the Code Bubbles team from Brown University and the Code Canvas team from Microsoft Research presented similar ideas for new user experiences for an integrated dev...
Robert DeLine, Andrew Bragdon, Kael Rowan, Jens Ja...