Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
Lecture
Closest Vector Problem: Voronoi Cells
Description
This lecture covers the Closest Vector Problem (CVP) and Voronoi cells, discussing the concept of lattice reduction and the properties of Voronoi cells. The instructor explains the algorithm for finding the closest vector to a target in a lattice, emphasizing the importance of unique minimal representations and facet-defining inequalities.
Official source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.