Connecting the dots in hyperspace: Why we built lance-csr
We introduce lance-csr, a fast graph query engine over Lance datasets that enables exact queries in Cypher or SQL, and associative search with hypervectors over a single copy of the data.
Showing 1–10 of 17 posts
We introduce lance-csr, a fast graph query engine over Lance datasets that enables exact queries in Cypher or SQL, and associative search with hypervectors over a single copy of the data.
A graph can discover groups that an HDC bundle later recognizes. HDLouvain shows what that shortcut buys, and raises a harder question about what the memory keeps.
When a robot's load, charge or temperature changes, a familiar route can make very different demands. We explore how HDC memory could help it prepare for the journey ahead.
How TrainableHD learns its encoder as well as its classes. We follow a mistake through training, work through an incident example, and examine the costs of deployment.
An HDC experiment that separates stored examples from temporary class summaries, and compares rebuilding with caching.
The most similar past incident may not be the most useful. What if search could take today's equipment, conditions, and resources into account?
Why shared bipolar binding preserves a ranking, how weighted similarity can change it, and what remains to be tested for useful retrieval.
How a compact abstraction can use thousands of coordinates, and what the extra width buys an HDC system.
A warehouse robot's detour shows how connected evidence and HDC memory could help AI reuse experience while checking what is valid now.
What a new neuroscience framework proposes about context, compression, and action, and how HDC could turn those ideas into a computational architecture.
Contact
If you're working with connected data, retrieval, agent memory or online learning, we'd love to hear what you're building and where the current representation is falling short.
We usually reply within two business days.