Abstract: We revisit the problem of secret key agreement using interactive public communication for two parties and propose a new secret key agreement protocol.
Abstract: From the early days of wireless networking research, graphs have commonly been used to model wireless communications and interference. Much theoretical work was done on simple range models, like Unit Disc Graphs.
Abstract: High dimensional problems are ubiquitous in machine learning and many other fields such as biology, finance, environmental science, medicine, etc.
Abstract: Over the last 3--4 years, there has been a sudden surge of results in arithmetic circuit lower bounds, specifically for shallow circuits (depth 3 or 4).
Abstract: Recent years have seen application of Linear programming techniques to solve problems in scheduling. One technique that has been applied very effectively to both online and offline scheduling problems is the Primal-Dual method.
Abstract: Even the most seasoned students of evolution, starting with Darwin himself, have occasionally expressed amazement that the mechanism of natural selection has produced all of life as we see it around us.
Abstract: Matrix decomposition, where we wish to approximate a given matrix as a sum or product of two or more structured matrices, plays a fundamental role in many machine learning applications.
Abstract: k-satisfiability is a constraint satisfaction problem where one wants to find the assignments of Boolean variables that satisfies a given set of constraints(or clauses).
