Abstract: Greedy pursuit, which includes matching pursuit (MP) and orthogonal matching pursuit (OMP), is an efficient approach for sparse approximation. However, conventional greedy pursuit algorithms ...

Abstract: Internet ride sharing allows multiple passengers to share a trip in the same vehicle, enabling cost sharing as well as reducing traffic congestion. However, existing technological ...

Your browser does not support the audio element. Let’s take a look at the compression algorithm behind Unix’s compress and most .gif compression. The Lempel Ziv ...

Finding bipartite matchings is one of the oldest and most well-studied problems in computer science. This problem comes up in many guises, such as when matching donors to recipients for organ ...

This project aims to reproduce the results of the paper titled "Streaming Algorithm for Monotone k-Submodular Maximization with Cardinality Constraints," published in ICML, 2022. The main goal of the ...

A team of computer scientists has come up with a dramatically faster algorithm for one of the oldest problems in computer science: maximum flow. The problem asks how much material can flow through a ...

Article Views are the COUNTER-compliant sum of full text article downloads since November 2008 (both PDF and HTML) across all institutions and individuals. These metrics are regularly updated to ...

To solve the low efficiency of simple greedy algorithms, [22] in 2009 proposed a degree discount heuristics to improve influence spread, by considering the degree discount of a candidate node caused ...