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?
Abstract: The possibility of capturing high quality images directly from the microscope, and transmitting them for distance diagnosis purposes using a mobile cell-phone (m-phone), that we define MobileDiagnosis, can significantly increase training
Abstract: River basin geomorphology is a very old subject of study initiated by Horton (1945). Various statistical models of drainage networks have been proposed. Each such model is a random directed graph with its own nuances.
Abstract: In this talk, I present a new algorithm for the statistical model checking of Markov chains with respect to unbounded temporal properties, such as reachability and full linear temporal logic.
