Abstract: In today's age we have an abundance of massive data available online. This creates fantastic opportunities for Statistical learning researchers to analyze data and estimate ongoing patterns.

Abstract: Protecting data in computer systems from being misused is a basic requirement.

Abstract: We consider the problem of computing a large stable matching in a bipartite graph G = (A U B, E) where each vertex ranks its neighbors in an order of preference, perhaps involving ties.The goal is to compute a large stable matching.