Skip to content
#

probabilistic

Here are 60 public repositories matching this topic...

XVilka
XVilka commented Aug 9, 2019

For easier integration (or porting) with the existing Prolog libraries/programs, since DCG are popular in Prolog world.

number --> digit, number_remaining.
number_remaining --> dot,number_remaining.
number_remaining --> digit,number_remaining.
number_remaining([],[]).
dot -->[0'.].
digit --> [J], {digit_code(J)}.
digit_code(J):- J >= 0'0, J =< 0'9.
mds2120
mds2120 commented Oct 17, 2018

Each section of the Users Manual should have a small discussion of theory behind the method. This should be just enough to understand the inputs and outputs, without derivations (typically no more than one page, see e.g. Nataf). If the theory is complex and requires elaborate discussion, references should be provided that give adequate background to the user.

  • MCS

  • LHS

  • STS

A novel, space-efficient, probabilistic data structure for hashing a large number of values. It is similar to a hash table, but smaller because it does not need to store the entire value like HashTable and has better asymptotic performance, at the cost of possible false-positives, a likelihood that is configurable. False negatives are not possible. Best use case: Lightweight check if a value/query exists to reject needless/bogus call in place before performing a more latent or expensive request, such as a search for content or database call.

  • Updated May 5, 2019
  • C#

Improve this page

Add a description, image, and links to the probabilistic topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the probabilistic topic, visit your repo's landing page and select "manage topics."

Learn more

You can’t perform that action at this time.