arXiv (All)
open access
Computation and Applications of Euclidean and Normed Representations of Massive Data
This thesis investigates Euclidean-space and $\ell_p$-norm representations of different forms of data, with a focus on efficient algorithms for computing these representations in settings where the amount of data is very large. The applications of such representations are also discussed: they may be
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Planetary Feature Fields are Scalable Earth Representations#1142093
- A threshold phenomenon for embeddings of Euclidean snowflakes and impossibility of dimension reduction#821060
- Algorithmic number theory, Vol. 1: Efficient algorithms#490163
- TV-SGS: Gaussian Splatting with Geometric Information Propagation via Tensor Voting under sparse views#984635
- Unified and Efficient Approach for Multi-Vector Similarity Search#2768
Record · ID 973910
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive