Cyber–physical systems: A perspective at the centennial

KD Kim, PR Kumar - Proceedings of the IEEE, 2012 - ieeexplore.ieee.org
Cyber-physical systems (CPSs) are the next generation of engineered systems in which
computing, communication, and control technologies are tightly integrated. Research on …

Fundamentals of large sensor networks: Connectivity, capacity, clocks, and computation

NM Freris, H Kowshik, PR Kumar - Proceedings of the IEEE, 2010 - ieeexplore.ieee.org
Sensor networks potentially feature large numbers of nodes. The nodes can monitor and
sense their environment over time, communicate with each other over a wireless network …

Network coding for computing: Cut-set bounds

R Appuswamy, M Franceschetti… - IEEE Transactions …, 2011 - ieeexplore.ieee.org
The following network computing problem is considered. Source nodes in a directed acyclic
network generate independent messages and a single receiver node computes a target …

The Trojan-proof chip

S Mitra, HSP Wong, S Wong - IEEE Spectrum, 2015 - ieeexplore.ieee.org
A lot of research is still being devoted to understanding the scope of the problem. But
solutions are already starting to emerge. In 2011, the United States' Intelligence Advanced …

Matching the Statistical Query Lower Bound for -Sparse Parity Problems with Sign Stochastic Gradient Descent

Y Kou, Z Chen, Q Gu, S Kakade - Advances in Neural …, 2025 - proceedings.neurips.cc
The $ k $-sparse parity problem is a classical problem in computational complexity and
algorithmic theory, serving as a key benchmark for understanding computational classes. In …

Optimal function computation in directed and undirected graphs

H Kowshik, PR Kumar - IEEE Transactions on Information …, 2012 - ieeexplore.ieee.org
We consider the problem of information aggregation in sensor networks, where one is
interested in computing a function of the sensor measurements. We allow for block …

Making polynomials robust to noise

AA Sherstov - Proceedings of the forty-fourth annual ACM symposium …, 2012 - dl.acm.org
A basic question in any computational model is how to reliably compute a given function
when the inputs or intermediate computations are subject to noise at a constant rate. Ideally …

Building a bionic nervous system

T Denison, M Morris, F Sun - IEEE Spectrum, 2015 - ieeexplore.ieee.org
It's an electrifying time to be in neuroscience. Using implanted devices that send pulses of
electricity through the nervous system, physicians are learning how to influence the neural …

Broadcasting in noisy radio networks

K Censor-Hillel, B Haeupler, DE Hershkowitz… - Proceedings of the …, 2017 - dl.acm.org
The widely-studied radio network model [Chlamtac and Kutten, 1985] is a graph-based
description that captures the inherent impact of collisions in wireless communication. In this …

Information-theoretic lower bounds for distributed function computation

A Xu, M Raginsky - IEEE Transactions on Information Theory, 2017 - ieeexplore.ieee.org
We derive information-theoretic converses (ie, lower bounds) for the minimum time required
by any algorithm for distributed function computation over a network of point-to-point …