michelpp

10 ms·

61.
by michelpp 3y ago
Tackling these boundary problems are the literal "edge cases" in geospatial indexing and they exist everywhere, so this i a good reason for using an existing library as the authors have already solved them. Hexagons are cool, but
62.
by michelpp 3y ago
I experimented with geospatial Hilbert Curves as a Postgres extension [0] for PostGIS using the S2 [1] spherical geometry library. S2 uses a scale free cell coverage pattern that is numbered using six interlocking space filling Hilbert Cur
63.
by michelpp 3y ago
I don't know much about it, but I think this has been tried? https://dylibso.com/blog/pg-extism/ Looking at the repo though it looks like it hasn't been updated in a while.
64.
by michelpp 3y ago
This looks very cool and it's nice to see some finicky details like PG_GETARG abstracted away. Are there any plans to make pgzx a Trusted Language so that Zig functions could be written with CREATE FUNCTION? Rust recently achieved thi
65.
by michelpp 3y ago
This is very cool and a real interesting read! For those in the comments confused about how this is better, the paper is talking about synthesizing matrix multiplication pipelines in hardware, like an FPGA or ASIC. On a CPU or GPU you won
66.
by michelpp 3y ago
Love PMO, get there a day or two early on a moonless weekend and you can usually score one of the campsites. >* The Christmas Valley area has a lot of interesting things like Fort Rock, Crack-in-the-Ground, Hole-in-the-Ground and the san
67.
by michelpp 3y ago
The midwest can definitely get dark, but the "seeing" isn't as good as the oregon outback for a few reasons, 1) elevation, most of eastern oregon is above 1200m, steens mountain is almost 3000m. 2) climate, the midwest can b
68.
by michelpp 3y ago
Was Alvord hot springs not open? I know they've been hit or miss over the years. It's pretty primitive, basically a hole dynamited into the ground but the water is amazing and it's usually never busy. They also have a grea
69.
Tropical Geometry of Deep Neural Networks(arxiv.org)
1 points by michelpp 3y ago|0 comments
70.
Algorithmic Complexities in Backpropagation and Tropical Neural Networks(arxiv.org)
2 points by michelpp 3y ago|0 comments
71.
by michelpp 3y ago
> Abstractions should be seen as models. They are always wrong, but they are sometimes useful. (And sometimes not.) George Box was very specifically talking about statistical models when he coined that aphorism. Matrices are linear al
72.
by michelpp 3y ago
When you consider that a graph and a matrix are isomorphic, doing vector matrix multiplication takes a vector with a set value, say row 4, and multiplies it by a matrix where row 4 has values present that represent edges to the nodes that a
73.
by michelpp 3y ago
> It's well understood, graphs can be conveniently represented as matrices/tables/relations, and they are equivalent to edge lists. Maybe I'm missing what you're saying here, but matrices are not "equivalent
74.
by michelpp 3y ago
> ex. "with 100 nodes and 200 edges...If we use an adjacency matrix representation...we need a 100×100 matrix containing 200 ones and 9,800 zeros. If we instead use an edge list we need only 200 pairs of nodes." The GraphBLAS i
75.
by michelpp 3y ago
In the language of Linear Algebra, the type of a graph is a sparse matrix. Adjacency matrices can express simple directed and undirected graphs, and Incidence matrices can express multi, hyper, and ubergraphs. The real power of using matri
76.
by michelpp 3y ago
Which can all be represented with Incidence Matrices: https://en.wikipedia.org/wiki/Incidence_matrix
77.
by michelpp 3y ago
RedisGraph is now FalkorDB: https://github.com/FalkorDB/FalkorDB
78.
by michelpp 3y ago
> you probably want more specialised tools like BLAS/LAPACK The GraphBLAS and LAGraph are sparse matrix optimized libraries for this exact purpose: https://github.com/DrTimothyAldenDavis/GraphBLAS https:&#x2F
79.
by michelpp 3y ago
I think one of the elements that author is missing here is that graphs are sparse matrices, and thus can be expressed with Linear Algebra. They mention adjacency matrices, but not sparse adjacency matrices, or incidence matrices (which can
80.
by michelpp 3y ago
A similar and more recent example of graph decomposition is the fast graphlet transform: https://github.com/fcdimitr/fglt This algorithm has a nice Algebraic formulation recently implemented with the GraphBLAS in LAGra
81.
by michelpp 3y ago
PageRank's linear algebraic formulation also has a natural interpretation in the GraphBLAS sparse graph linear algebra library. Here's an example from a paper that benchmarks C, Julia, and Python with pygraphblas (this example ha
82.
by michelpp 3y ago
system_stat is another one specific to PostgreSQL: https://github.com/EnterpriseDB/system_stats
83.
by michelpp 3y ago
Great! I was trying to remember the model name of this processor the other day in a conversation, and no amount of googling could bring it up, all my results were swamped by all the new AI-du-jour chips everyone is working on. The young p
84.
Introduction to the PGXN Architecture(tembo.io)
2 points by michelpp 3y ago|0 comments
85.
Postgres Extension Ecosystem: Jobs and Tools(gist.github.com)
2 points by michelpp 3y ago|0 comments
86.
by michelpp 3y ago
I like the "solve the now" perspective here, and having code examples is very helpful to understand some of the rational behind the approach. Having read your previous "tedious survey"[0] post on various token formats,
87.
by michelpp 3y ago
Sure let's chat about it in an issue thanks!
88.
by michelpp 3y ago
What piques my interest in this tool is that I haven't found a good "notebook" like solution for Postgres yet, I've tried using SQL magic functions in Jupiter to generate some documentation for pgsodium[1] but I'm n
89.
by michelpp 3y ago
Can Pluto do the same Postgres example given? I googled for it but didn't see anything immediately stand out.
90.
Sparse Matrix Algorithms (Stanford, June 2013, Tim Davis) [video](youtube.com)
2 points by michelpp 3y ago|0 comments

More ›