Algorithms on Graphs

A collection of ready-to-use computer graphing programs for mathematicians and engineers. Can be used to solve problems in connectivity, shortest paths, traversability, node-coloring, minimum spanning, maximum cardinality matching, and planarity testing. A disk is available. Annotation copyright Book News, Inc. Portland, Or.

ASIN

0830634290

Embedding

CLIP ViT-L/14 · 768d

Distance metric

cosine

Doc fetch

2ms·cache hitGET /v2/namespaces/amazon-products/documents/0830634290

How it works

Similar query

19msnearest_to_id → /query

Doc fetch goes through Layer's Aerospike pull-through cache; cache hit served the row without touching turbopuffer. The similar query asks Layer for nearest neighbors of the stored product vector — queries don't go through the doc cache, so no cache header is set.