This paper investigates a new learning formulation called dynamic group sparsity. It is a natural extension of the standard sparsity concept in compressive sensing, and is motivat...
A popular approach in comparative genomics is to locate groups or clusters of orthologous genes in multiple genomes and to postulate functional association between the genes contai...
Data mining can be used to model crime detection problems. Crimes are a social nuisance and cost our society dearly in several ways. Any research that can help in solving crimes f...
The RandomAccess benchmark as defined by the High Performance Computing Challenge (HPCC) tests the speed at which a machine can update the elements of a table spread across globa...
Steven J. Plimpton, Ron Brightwell, Courtenay Vaug...
In this paper, we propose an iteration-free algorithm to find the optimal configuration, including transmit power and source coding rates, to maximize the lifetime of a cluster ...