Tags : Browse Projects

Select a tag to browse associated projects and drill deeper into the tag cloud.

barvinok

Compare

Claimed by Polly Labs Analyzed 1 day ago

barvinok is a library for counting the number of integer points in parametric and non-parametric polytopes.

50.9K lines of code

1 current contributors

about 2 months since last commit

3 users on Open Hub

Very Low Activity
0.0
 
I Use This

viewsizeestimation

Compare

  No analysis available

A data warehouse cannot materialize all possible views, hence we must estimate quickly, accurately, and reliably the size of views to determine the best candidates for materialization. Many available techniques for view-size estimation make particular statistical assumptions and their error can be ... [More] large. Comparatively, unassuming probabilistic techniques are slower, but they estimate accurately and reliability very large view sizes using little memory. We propose five unassuming hashing-based view-size estimation techniques including Stochastic Probabilistic Counting, LogLog Probabilistic Counting, Generalized Counting, Gibbons-Tirthapura, and Adaptive Counting. More details are available at http://arxiv.org/abs/cs/0703058. [Less]

0 lines of code

0 current contributors

0 since last commit

0 users on Open Hub

Activity Not Available
0.0
 
I Use This
Mostly written in language not available
Licenses: LGPL

cardcounter

Compare

  No analysis available

This program is in beta. It is an open source project built on the .NET framework in C#. It is to teach blackjack card counting and help experienced counters sharpen their skills.

0 lines of code

0 current contributors

0 since last commit

0 users on Open Hub

Activity Not Available
0.0
 
I Use This
Mostly written in language not available
Licenses: GPL-3.0+

dodajnik

Compare

  No analysis available

Just another counting machine

0 lines of code

0 current contributors

0 since last commit

0 users on Open Hub

Activity Not Available
0.0
 
I Use This
Mostly written in language not available
Licenses: MIT

fkt

Compare

  Analyzed 23 days ago

An implementation of the FKT algorithm for counting the number of perfect matchings in a graph. Written using the Gforth programming language.

5.23K lines of code

0 current contributors

over 4 years since last commit

0 users on Open Hub

Inactive
0.0
 
I Use This