DIMACS | Center for Discrete Mathematics and Theoretical Computer Science
Helly’s theorem gives a characterization of families of convex sets in R^d with non-empty intersection. Its quantitative versions aim to characterize families of convex sets with “large” intersection, which can
Many tasks in machine learning statistics scientific computing and optimization ultimately boil down to numerical linear algebra Randomized numerical linear algebra RandNLA exploits randomness to improve matrix algorithms for fundamental problems like matrix multiplication and least squares using techniques such as random sampling and random projection RandNLA has received a
Microsoft Research NYC will host the Fall 2019 DIMACS Mixer The Mixer will give the DIMACS community a chance to learn about new things that are happening at DIMACS while meeting new people and reconnecting with others The event features an invited talk entitled A Calculus for Brain Computation by
This workshop is an affiliated event of the Crypto 2019 Conference It is presented under the auspices of the DIMACS Special Focus on Cryptography as part of the DIMACS Simons Collaboration in Cryptography The Crypto 2019 Conference will be preceded by several one day affiliated workshops and the Workshop on
Link to the CCC 19 main page http computationalcomplexity org Scope CCC aims to foster research in all areas of computational complexity theory studying the absolute and relative power of computational models under resource constraints Typical models include deterministic nondeterministic randomized and quantum models uniform and nonuniform models Boolean algebraic
The workshop will bring together students and researchers working in algorithms computational complexity and combinatorics It will consist of four tutorials on recent advances in those fields in mornings and will allow for work in smaller groups in the afternoon The tutorial speakers are Eric Allender Rutgers University Alexandr Andoni
Distance Geometry DG has a rich mathematical history rooted in Heron s theorem for computing the area of a triangle from the lengths of its sides DG was further developed in the 1800s and 1900s by Cayley Maxwell Menger and Isaac Schoenberg who gave among other things an algebraic proof
