12 Commits (0d7e23320e5caa7e1ab3322ceadd9444a5dfb73c)

Author	SHA1	Message	Date
unknown	6dc71702f5	Clean&Refactoring&Migrate to .net 6	3 years ago
unknown	2d1e4f9d5b	HNSW ... MNIST test Fix process find of cutoff for bimodal histogram	3 years ago
unknown	adf09b08c8	HNSW ... Fix INSERT algorithm	3 years ago
unknown	28ccefa255	HNSW ... Optimization for big data. Quantization	3 years ago
unknown	1b6c56033f	HNSW ... Links trimming	3 years ago
unknown	50e2e90251	HNSW. Optimized version	3 years ago
unknown	ecd223ebdb	Start optimizations	3 years ago
unknown	2d2616ddce	HNSW ... Add AutomaticGraphClusterer	3 years ago
unknown	33e2048862	HNSM ... Append histogram OTSU method for histogram - detect bound between intra-cluster distance and out-of-cluster distance	3 years ago
unknown	0cef043b26	Append modification for LookAlike	3 years ago
unknown	c128396ac1	HNSW. Append inactive nodes ... Active and inactive nodes placed in SearchContext	3 years ago
unknown	f8b72e38e3	ReadOnlySmallWorld ... The ability to create a compact representation from a graph. Only for reading. Memory costs in bytes are reduced by the formula: MemCompact = MemFull - AllLinks * 4	3 years ago