Spherical Euclidean Distance Embedding and the Unit-Distance Respresentation of a Graph on a Hypersphere
Released Monday, 12th August 2013
Good episode? Give it some love!
Spherical Euclidean Distance Embedding and the Unit-Distance Respresentation of a Graph on a Hypersphere
Spherical Euclidean Distance Embedding and the Unit-Distance Respresentation of a Graph on a Hypersphere
Monday, 12th August 2013
Good episode? Give it some love!
Rate Episode
Rate
From The Podcast
Polynomial Optimisation
Optimisation problems involving polynomials arise in a wide variety of contexts, including operational research, statistics, probability, finance, computer science, structural engineering, statistical physics, combinatorial chemistry, computational biology and algorithmic graph theory. They are however extremely challenging to solve, both in theory and practice. Existing algorithms and software are capable of solving only very small instances to proven optimality, unless they have some amenable structure, such as sparsity or convexity.Read more at: http://www.newton.ac.uk/programmes/POP/Join Podchaser to...
- Rate podcasts and episodes
- Follow podcasts and creators
- Create podcast and episode lists
- & much more
Episode Tags
Do you host or manage this podcast?
Claim and edit this page to your liking.
,Claim and edit this page to your liking.
Unlock more with Podchaser Pro
- Audience Insights
- Contact Information
- Demographics
- Charts
- Sponsor History
- and More!
- Account
- Register
- Log In
- Find Friends
- Resources
- Help Center
- Blog
- API
Podchaser is the ultimate destination for podcast data, search, and discovery. Learn More
- © 2024 Podchaser, Inc.
- Privacy Policy
- Terms of Service
- Contact Us