-
We need to see how the algorithm behaves with vol surfaces.
In Sophis we need to re-generate the whole volatility surface at once (typically 10y in maturity and from 0 to 500% in strike performance.
W…
-
`stats --everything` will buffer everything in memory and thus it (and its implied flags) sensibly isn't on by default. However, those numbers are still useful for understanding a data set (especially…
huonw updated
6 years ago
-
### Description
We are interested in increasing the state witness size limit to improve throughput of the protocol. The state witness is produced by some particular node (chunk producer) and needs …
-
I think it would be helpful to clarify which lists should be thought of an ordered lists vs unordered sets. The consistent prefix `listOf` suggests these data structures should be interpreted the same…
-
# Question 1:
While we don't explicitly use 2D arrays or their algorithms in our Java code, we do go about manipulating the database with the concepts and methodology that we would with 2D arrays. …
-
Proceedings of the Third International Workshop on In-Memory Data Management and Analytics (IMDM 2015)
http://portalparts.acm.org/2810000/2803140/fm/frontmatter.pdf?ip=58.251.152.225&CFID=603267437&C…
-
One of the main questions of the professors was:
"Why are the dots so spread for larger formulas?"
We should be able to answer that question in a "scientific" way, i.e. something like this:
"The …
-
A meet in the middle algorithm might be significantly faster.
-
Execute full sorting merge join algorithm in parallel.
**Idea 0**
Shard data by hash.
Execute multiple independent reads where data is filtered by `hash(join keys) % num_threads`.
This optimizat…
-
How to use GPU to run this codes?