Project Grant 2427362
Award Date
10/1/24
Completion Date
9/30/27
Dollars Obligated
$300K
Federal Agency
Division of Computing and Communication Foundations
Federal Grant Program
47.070
Assistance Type
Project Grant
Place of Performance
Amherst, MA 01003, USA
Similar Awards
This $300,000 project grant award from the National Science Foundation's (NSF) Computer and Information Science and Engineering (CISE) program (CFDA 47.070) supports research on the query complexity of linear algebra problems. The overarching goal is to develop more efficient algorithms for solving core matrix problems, such as systems of linear equations and eigenvalue computations, which have widespread applications across machine learning, scientific computing, and engineering. The research...
The Massachusetts Institute of Technology (MIT) received a $499,999 Project Grant award from the National Science Foundation (NSF) to conduct research titled "AF: SMALL: LOWER BOUNDS IN COMPLEXITY THEORY VIA ALGORITHMS" under the NSF's Computer and Information Science and Engineering program (CFDA 47.070). The three-year award beginning October 1, 2021 provides $499,999 in funding for MIT researchers to develop new algorithms aimed at establishing theoretical lower bounds in...
This Project Grant award of $600,000 from the National Science Foundation (NSF) Computer and Information Science and Engineering (CFDA 47.070) program supports fundamental and applied research in extremal combinatorics and the analysis of algorithms. The key objectives are to solve basic classification questions in the theory of pattern-avoiding 0-1 matrices and to apply these methods to resolve prominent open problems in computer science, such as the Dynamic Optimality Conjecture. The...
This $122,000 Project Grant award, funded by the National Science Foundation's (NSF) Computer and Information Science and Engineering (CISE) program (CFDA 47.070), supports research to develop new mathematical tools and techniques for analyzing sampling algorithms used to manipulate and understand complex, high-dimensional probability distributions. The project will focus on three foundational problems in theoretical computer science, with the goal of designing fast, efficient sampling...
The National Science Foundation awarded a $599,995 project grant to the University of Massachusetts under the Computer and Information Science and Engineering program (CFDA 47.070) for the period of September 1, 2022 through August 31, 2025. The grant funds research to develop scalable in-database prescriptive analytics capabilities for dynamic environments. Specifically, the university researchers will extend prior work on constrained optimization problems to handle data uncertainty and...
This National Science Foundation (NSF) Project Grant award under the Mathematical and Physical Sciences federal grant program (CFDA 47.049) will explore new ways to address complex mathematical problems by integrating advanced machine learning techniques with automated reasoning. The $418,035 grant awarded to Carnegie Mellon University will support a collaborative research effort between mathematicians and computer scientists to develop and evaluate new algorithms for solving three specific open...
The National Science Foundation (NSF) Division of Mathematical Sciences awarded a $322,730 Project Grant to the University of Texas at Austin from September 1, 2023 to August 31, 2026. The grant is funded under NSF's Mathematical and Physical Sciences Program (CFDA 47.049) and aims to develop techniques for assessing the accuracy of randomized algorithms used to solve fundamental linear algebraic equations in computational science. The project will focus on improving the speed and robustness...
This $571,919 Project Grant award to the Massachusetts Institute of Technology (MIT) is funded by the National Science Foundation's (NSF) Computer and Information Science and Engineering (CISE) program (CFDA 47.070). The goal of this 3-year project is to leverage algorithms and computer science knowledge to prove new complexity lower bounds, which will help elucidate the limits and possibilities of computing. The research aims to establish mathematical connections between algorithms and lower...
The National Science Foundation (NSF) awarded a $600,000 Project Grant titled "TOWARD HIGH-PERFORMANCE BLOCK KRYLOV SUBSPACE ALGORITHMS FOR SOLVING LARGE-SCALE LINEAR SYSTEMS" under its Computer and Information Science and Engineering program (CFDA 47.070). The grant recipient, CAL Poly Pomona Foundation Inc., a non-profit organization, will develop new numerical algorithms to rapidly solve large-scale linear systems that are crucial for data analysis and scientific computing...
This $447,875 Project Grant award under the National Science Foundation's (NSF) Computer and Information Science and Engineering (CFDA 47.070) program supports research at the University of Texas at San Antonio (UTSA) to advance the theoretical foundations for efficiently processing real algebraic sets. The key objectives are to: Design algorithms for finding complex zeros of sparse polynomial equation systems in average-case polynomial time. Investigate the relationship between description...