-
### Is your feature request related to a problem? Please describe
Dynamic pruning algorithms work by dynamically adding negating filters into the query as disjunctions which are non-competitive( or…
-
Hi,
Your implementation is really elegant. But I tried your code on the real MINIST dataset, and it took up to almost 100 GB memory before I force stopped. Do you have any idea about this?
-
> There may be other ways than pruning to speed up the FFT. In a unifom-to-nonuniform 2D NUFFT with, say, an oversampling factor of 2, you only need to transform over the first axis for half of the ar…
-
investigate to see if there are low hanging fruits to reduce the db size.
-
Step 3 of the [association region] procedure in Section 9.3.2 is ambiguous if multiple descendants are associated with a region (possibly distinct).
Suggest changing from:
"if the element contains a…
-
As agreed on in #3851 , we should add a costing option to disable hierarchy pruning. It's fairly easy:
- add a `max_distance_disable_hierarchy_culling` (long, but exact) to the JSON config generator …
-
Comment below with questions or thoughts about the reading for this week's workshop.
Please make your comments by Wednesday 11:59 PM, and upvote at least five of your peers' comments on Thursday pr…
-
**Describe the bug**
after upgrade Vagrantfile from` domain.memory=10240 `to `domain.memory = 15240` and run `sudo vagrant reload worker-1 --provision ` it prompt an error message. ( see belo…
-
_brainstorm_ Survey+thesis
1 course msc for Q1 left. Did ML course and industry Kubernets experience. prior google summer of code experience. Python == main working language. Possibly: https://bitco…
-
Hi. I'm using `AMIE+` in my master's project, and I have recently (i.e., yesterday) found out about `AMIE3` paper and this repo.
I've made some initial effort in comparing my `AMIE+`-based experim…