Explore >> Select a destination
|
You are here 
|
healeycodes.com | ||
| | | | |
adamj.eu
|
|
| | | | | When trying to improve a slow function or module, it's always a good idea to profile it. Here's a snippet for quickly profiling a section of code with Python's cProfile module, in two flavours. It's adapted from the cProfile documentation's Profile example. I have used versions of this snippet over the years to narrow in on performance issues. | |
| | | | |
ehmatthes.com
|
|
| | | | | I was working on a longer post recently about optimizing a messy exploratory Python project, where the file I was focusing on took about 16 seconds to run. | |
| | | | |
vcansimplify.wordpress.com
|
|
| | | | | This post discusses the various graph data structures I have tested. A few days ago I briefly discussed the same in this post. I plan to elaborate more here and also discuss the CSR representation. The tests have been done from the point of view of feasibility to use for Region Adjacency Graphs ( RAGs... | |
| | | | |
almostsuremath.com
|
|
| | | The aim of this post is to motivate the idea of representing probability spaces as states on a commutative algebra. We will consider how this abstract construction relates directly to classical probabilities. In the standard axiomatization of probability theory, due to Kolmogorov, the central construct is a probability space $latex {(\Omega,\mathcal F,{\mathbb P})}&fg=000000$. This consists... | ||
