192 citations · 242 across the 13 of their papers we have counts for
14 papers
Connected Components for Infinite Graph Streams: Theory and Practice
Jonathan W. Berry, Cynthia A Phillips, Alexandra M. Porter
Motivated by the properties of unending real-world cybersecurity streams, we present a new graph streaming model: XStream. We maintain a streaming graph and its connected component…
Constant-Depth and Subcubic-Size Threshold Circuits for Matrix Multiplication
Ojas Parekh, Cynthia A. Phillips, Conrad D. James +1
Boolean circuits of McCulloch-Pitts threshold gates are a classic model of neural computation studied heavily in the late 20th century as a model of general computation. Recent adv…
Fractional Decomposition Tree Algorithm: A tool for studying the integrality gap of Integer Programs
Robert D. Carr, Arash Haddadan, Cynthia A. Phillips
We present a new algorithm, Fractional Decomposition Tree (FDT) for finding a feasible solution for an integer program (IP) where all variables are binary. FDT runs in polynomial t…
Probing a Set of Trajectories to Maximize Captured Information
Sándor P. Fekete, Alexander Hill, Dominik Krupke +4
We study a trajectory analysis problem we call the Trajectory Capture Problem (TCP), in which, for a given input set of trajectories in the plane, and an integer $k\geq…
Virtually the Same: Comparing Physical and Virtual Testbeds
Jonathan Crussell, Thomas M Kroeger, Aaron Brown +1
Network designers, planners, and security professionals increasingly rely on large-scale virtual testbeds to emulate networks and make decisions about real-world deployments. Howev…
The Online Event-Detection Problem
Michael A. Bender, Jonathan W. Berry, Martin Farach-Colton +5
Given a stream , a -heavy hitter is an item that occurs at least times in . The problem of finding heavy-hitters has been extensively stu…