New algorithm can dramatically streamline solutions to the ‘max flow’ problem
Research could boost the efficiency even of huge networks like the Internet.
New approach to vertex connectivity could maximize networks’ bandwidth
Technique advances understanding of a basic concept in graph theory, paralleling advances in edge connectivity.
Never forget a face
New algorithm uses subtle changes to make a face more memorable without changing a person’s overall appearance.
Leaner Fourier transforms
New algorithm can separate signals into their individual frequencies using a minimal number of samples.
Eliminating unexplained traffic jams
If integrated into adaptive cruise-control systems, a new algorithm could mitigate the type of freeway backup that seems to occur for no reason.
Reliable communication, unreliable networks
A new model of wireless networks that better represents the real world could lead to more robust communications protocols.
Pruning the power grid
New algorithm quickly identifies the most dangerous risks in a power grid amid millions or billions of possible failures.
New algorithm finds best routes for one-way car sharing
The most efficient car-sharing, researchers find, also includes shuttle services.
How computers can learn better
With a recently released programming framework, researchers show that a new machine-learning algorithm outperforms its predecessors.
Finding a gecko in the crowd
A combination of crowdsourcing and computer vision could identify individuals within endangered populations.
Short algorithm, long-range consequences
A new technique for solving ‘graph Laplacians’ is drastically simpler than its predecessors, with implications for a huge range of practical problems.
Demaine named Presburger Award recipient
Professor Erik Demaine was cited for his contributions to computational geometry and data structures.
Toward practical compressed sensing
Researchers show how the vagaries of real-world circuitry affect the performance of a promising new technique in signal processing and imaging.
Guaranteed delivery — in ad hoc networks
A new algorithm for message dissemination in decentralized networks is faster than its predecessors but, unlike them, guarantees delivery.
Explained: Graphs
A simple tool for representing relationships between data, devices or almost anything else has ubiquitous applications in computer science.