Christoph Conrads' Blog

Search
Skip to content
  • Home
  • About
  • Projects
  • Contact

cover_tree_cpu_time_construction

September 6, 2016 968 × 867 The Discretized Laplace Operator on Hyperrectangles with Zero Dirichlet Boundary Conditions

Mean and standard deviation of the CPU time needed for the batch construction of a nearest ancestor cover tree with Manhattan, Euclidean, and Chebychev metric

Next Image

Scientific Computing

  • Rademacher Floating Point Library
  • All my GitHub comments
  • My GitHub profile
  • My GitLab profile

Recent Posts

  • The Russians are Winning
  • The Third French Confinement Starts on January 14, 2022
  • Risk of SARS-CoV-2 Death is Low in Unvaccinated Individuals without Comorbidities
  • The Next Great Depression Is Almost Here
  • The Fundamental Importance of Adversarial Examples to Machine Learning

Tags

  • programming
  • linear-algebra
  • benchmark
  • C++
  • how-to
  • talk
  • prediction
  • politics
  • Matlab
  • garbage-collection

Archives

  • March 2022
  • January 2022
  • December 2021
  • May 2019
  • April 2019
  • February 2019
  • March 2018
  • February 2018
  • January 2017
  • December 2016
  • November 2016
  • September 2016
  • July 2016
  • June 2016
  • April 2016
  • March 2016
  • February 2016
  • January 2016
  • September 2015
  • July 2015
  • April 2015
  • March 2015
  • February 2015
  • January 2015
  • December 2014

Meta

  • Log in
  • Entries feed
  • Comments feed
  • WordPress.org
Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
Proudly powered by WordPress