-
I’m trying to figure out how I can run a count(distinct) query in Lens and generate precise results. Our Unique Count aggregation in Lens is producing wrong results vs an external deterministic unique…
-
Hello @HenningTimm ,
Thanks for making the simple and twisted tabular hash function. I feel this is the only implementation available online (original paper did not provide any implementation). I a…
-
Idea for a future enhancement: visualization of graph partitioning algorithms. There are many algorithms that could be considered, but this data and mapping functionality is appropriate to support vis…
-
```
What steps will reproduce the problem?
Work is distributed in small chunks to workers, so the communication and
latency of distributing work and receiving status updates can significantly
affect o…
-
This commit seems to have removed k-partitioning support for kernighan-lin:
https://github.com/LIHPC-Computational-Geometry/coupe/commit/1ef583fb1e450a898d390f06904f70fa1aa351c9
-
### Problem Description
Currently, SageMath lacks efficient algorithms for enumerating the ideals of a partially ordered set (poset) in logarithmic time complexity. An enumeration of the ideals of a …
-
Many recently added functions ( clipping, regridding, partitioning, masking) are not tested on non-equidistant grids.
We should test what features work and what features don't, and then we can decide…
-
```
Purpose of code changes on this branch:
Merge back the latest aggregation algorithms. There are mainly three algorithms:
- improved external-hash (slot-based);
- original hybrid-hash
- pre-partiti…
-
```
Purpose of code changes on this branch:
Merge back the latest aggregation algorithms. There are mainly three algorithms:
- improved external-hash (slot-based);
- original hybrid-hash
- pre-partiti…
-
```
Purpose of code changes on this branch:
Merge back the latest aggregation algorithms. There are mainly three algorithms:
- improved external-hash (slot-based);
- original hybrid-hash
- pre-partiti…