-
When memorizing a sequence (1D intervention) is it possible to attend to it, as in 'where is GO-> located' (Stanford).?
I'd be interested in using pyreft for 'online-learning' similar to approach…
-
-
## What is the Problem Being Solved?
The current [@agoric/orchestration](https://agoric-sdk.pages.dev/modules/_agoric_orchestration) reference docs (JSDocs) are incomplete for the purpose of devrel …
-
Once this proposal gets to Phase 3 and we can study the performance of realistic workloads, I think it's important for this group to measure a workload that, e.g., uses stack-switching for both genera…
-
In Reason's "Florida FRS inputs.xlsx" file, in the "Amort Input" sheet, the column amo_period is n/a for one row for each class other than drop. In each case, the surrounding values have amo_period of…
-
`FTCQueue` has worst-case constant-time `>` + amortized constant time `tviewl`. `type-aligned` also offers [`FastCatQueue`](https://hackage.haskell.org/package/type-aligned-0.9.6/docs/Data-TASequence-…
-
I have read Gordon‘s work named two-party computation in sublinear (amortized) time,he refers that combining the oram and secure computation can achieve two-Party computation in sublinear (Amo…
-
A Fibonacci heap is a data structure for priority queue operations, consisting of a collection of heap-ordered trees. It has a better amortized running time than many other priority queue data structu…
-
The dependency used to extract json paths does a vec and multiple string allocs per query. We could do a PR and improve their API. Allocations could be amortized.
Another useful feature would be a…
-
https://github.com/plasma-umass/slipcover - if the overhead of adding instrumentation is low, this could be a big win - and amortized across many unlikely-to-find-new-branches executions anyway if no…