A randomized algorithm for approximating the volume of a convex body K in n-dimensional Euclidean space was proposed by Martin Dyer, Alan Frieze and Ravi Kannan in 1988.
Computer science (CS) has emerged in last 40+ years to be a branch of science on its own. The concerns in CS involve all the way from fundamentals of mathematics to designing usable social networking apps.
A set function on a ground set of size n is approximately modular if it satisfies every modularity requirement to within an additive error;approximate modularity is the set analog of approximate linearity.
Boolean functions are central to computer science. This presentation will focus on Boolean functions from the perspective of certain measures of complexity.
In this talk we will introduce the optimal transportation problem and mention some of its applications. We will then present the duality theory for the optimal transportation problem.
Groebner basis for a multivariate polynomial ideal is a finite basis of polynomials that has many useful properties. Large memory requirements and computation time for most practical problems hinder the use of Groebner basis in many areas.
Utilities—water, gas, oil, electricity, and communications—are critical infrastructures that rely heavily on industrial networks and automated control systems. The disruption of any of these systems, could impact our society and our safety.
