-
Optimize the heavily used functions and methods in `polytope`.
Possibly by pushing some things to `C` using `Cython` (optional, i.e., installation shouldn't break in case compilation fails).
The pro…
-
It was raised that the current design limits the creation of an `execution_context` to a single `execution_resource` therefore enforcing that the `execution_context` represent all member `execution_re…
-
Author: @vqd8a
-
Hello,
I have an example of a graph with 100 nodes and ~230 edges that reproduces an order of magnitude difference in running time when comparing nodePlacement strategy NETWORK_SIMPLEX to the defau…
-
## Overview
One common problem around dense vector search is the amount of memory required to implement a solution that delivers high performance and recall. The problem is grounded in the fact tha…
-
A logical region defined by subtraction of two regions is nether open nor closed. This leads to inconsistency in the overall design. The same region could be defined as a box or as a logical subtracti…
-
I think it would be valuable for the users (at least for me) to have a quickselect algorithm (or any alternative algorithm) to find the kth smallest element in a given array (and a segmented version).…
-
When dealing with large datasets and memory constraints, one popular clustering algorithm that can be effective is the DBSCAN (Density-Based Spatial Clustering of Applications with Noise) algorithm. D…
-
-
Created by: @kant111
Source: https://github.com/RedisGraph/RedisGraph/issues/425
1) Does RedisGraph partition the Graph? if so, what partitioning method is used?
2) is there any configuration I need …