computational science

Low Rank Everywhere (Almost)

-

B9 L2 R2322

Tile low-rank and hierarchical low-rank matrices can exploit the data sparsity that is discoverable all across computational science. We illustrate in large-scale applications and hybridize with similarly motivated mixed precision representations while featuring ECRC research in progress with many collaborators.

Finding the Face in the Crowd

1 min read ·
An algorithm that maximizes the difference between data categories achieves high accuracy in classifying faces.

Taking the guesswork out of experimental design

1 min read ·
A fast computational method optimizes sensor measurement networks for noisy, sparsely observed environments.

Faster prediction of wireless downtime

1 min read ·
An efficient simulation scheme that hones in on the rarest elements in a dataset can help predict capacity exceedances in wireless networks.

Sharing movement aids learning

1 min read ·
Automated learning of an individual’s movement patterns shared over mobile and social networks could help us to connect better.

Giving power to demand-driven electricity

1 min read ·
A new approach to analyzing household electricity: smart-meter data could improve the performance and efficiency of national power grids.