Bloom Filters and Tries (a comparison)
Add to your list(s)
Download to your calendar using vCal
If you have a question about this talk, please contact Phil Cowans.
What’s the most memory-compact useful language model for Dasher?
With audience participation, perhaps we can figure this out.
This talk is part of the Inference Group series.
This talk is included in these lists:
Note that ex-directory lists are not shown.
|