-
Just some thoughts:
1. I've been working on a bipartite problem, and the simple format of communityPGLMM with repulsion=T sets both site and sp to the repulsion matrix. To look at repulsion for jus…
-
It would be nice to move away from Serrano et al. to something more robust in a future release.
Possibly relevant literature: [1](https://doi.org/10.1209/0295-5075/113/28003), [2](https://arxiv.org…
-
```
What steps will reproduce the problem?
1. using sparse matrix available at
https://raw.github.com/gist/3422269/e0a585749a3a9ae84003fc368e80b69398a30d22/gis
tfile1.txt
2. ./bin/als training lsa_t…
-
- Graph construction was implemented using `rustworkx` in #234, I want to mention that the `rustworkx` python interface is remarkably optimized. Using Python, we can build all graph-downstream analyse…
-
This is a low priority request, and may not be a great idea...
When you are rerooting at an existing node and the tree is currently rooted at a polytomy, the number of nodes and edges in the tree doe…
-
We want to augment the list of matches (length `true points`) with lists for true sources with no predicted matches and predicted sources with no true matches.
-
### Description
Learned Sparse Vectors claim to combine the benefits of sparse (i.e. lexical) and dense (i.e. vector) representations
From https://en.wikipedia.org/wiki/Learned_sparse_retrieval:…
-
Hi Wei,
I have spent quite some time on your SSD code. And I have some questions about the implementation.
1. Do the training image size and testing image size have to be the same?
2. How to guara…
-
Based on Bersier et al. 2002; Banašek-Richter et al. 2009.
-
Hi,
it would be very nice to have a tool that creates a graph (hypergraph) on as a graphical representation. Are you aware of anything that goes in that direction?