har-vy

Hardik Vijayvargiya's repositories

strapi

🚀 Open source Node.js Headless CMS to easily build customisable APIs

MIT000

guppy

🐠A friendly application manager and task runner for React.js

ISC000

gBolt

gBolt--very fast implementation for gSpan algorithm in data mining

BSD-2-Clause000

SirixDB facilitates effective and efficient storing and querying of your temporal data. Every commit stores a space-efficient snapshot. It is log-structured and never overwrites data. SirixDB uses a novel page-level versioning approach called sliding snapshot.

BSD-3-Clause100

open-pixel-art

A collaborative pixel art project to teach people how to contribute to open-source

MIT000

strongbox

Strongbox is an artifact repository manager.

Apache-2.0000

FunnyAlgorithms

A repository with a bunch of funny algorithms, beginners friendly

Language:Java000

payment-app

000

celebrate-hacktoberfest-2018

Add anything meaningful related to programming and open source. A chance for everyone to do their first contribution!

NOASSERTION000

myFirstBlog

Language:Python100

GraMi

GraMi is a novel framework for frequent subgraph mining in a single large graph, GraMi outperforms existing techniques by 2 orders of magnitudes. GraMi supports finding frequent subgraphs as well as frequent patterns, Compared to subgraphs, patterns offer a more powerful version of matching that captures transitive interactions between graph nodes (like friend of a friend) which are very common in modern applications. Also, GraMi supports user-defined structural and semantic constraints over the results, as well as approximate results. For more details, check our paper: Mohammed Elseidy, Ehab Abdelhamid, Spiros Skiadopoulos, and Panos Kalnis. GRAMI: Frequent Subgraph and Pattern Mining in a Single Large Graph. PVLDB, 7(7):517-528, 2014.

Language:JavaNOASSERTION000