Parallelli

FacebookSan Francisco

Pinned Repositories

cmpt880
Language:C++0 1 00
Code4Fun
small but fun or useful code (misc programming laguage)
Language:Awk0 1 00
DataStructure
Data Structure Implementations
Language:C++0 1 01
FNP
Language:C#0 2 01
For-Sharing
Language:HTML00
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:Java0 1 00
hugoblog
Language:SCSS0 1 00
jackbash
My bash startup script
Language:Shell0 1 00
NeologismsExtraction
Language:Python3 1 00
parallelli.github.io
Language:HTML0 1 00

Parallelli/NeologismsExtraction
Language:Python3 1 00
Parallelli/cmpt880
Language:C++0 1 00
Parallelli/Code4Fun
small but fun or useful code (misc programming laguage)
Language:Awk0 1 00
Parallelli/DataStructure
Data Structure Implementations
Language:C++0 1 01
Parallelli/FNP
Language:C#0 2 01
Parallelli/For-Sharing
Language:HTML00
Parallelli/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:Java0 1 00
Parallelli/hugoblog
Language:SCSS0 1 00
Parallelli/jackbash
My bash startup script
Language:Shell0 1 00
Parallelli/parallelli.github.io
Language:HTML0 1 00
Parallelli/PersonalShare
Personal Stuff Share With Others