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).
Abstract: We will consider the fundamental trade-off between the compactness of information representation and the efficiency of information extraction in the context of the set membership problem.
A joint transmitter-receiver energy harvesting model is considered, where both the transmitter and receiver are powered by (renewable) energy harvesting source.
Abstract: Given a propositional logic formula $F$ in $CNF$, we consider two related problems: (i) generating satisfying assignments of $F$ uniformly at random, and (ii) counting the number of satisfying assignments.
Abstract: We consider a computer network, represented by a communication graph: each node represents a processor and the communication is done synchronously along the edges. Can such a network compute its own graph's properties?
