An Implementation of FP-Growth Algorithm Based on High Level Data Structures of Weka-JUNG Framework

اسناد مشابه

• MemPick: High-level data structure detection in C/C++ binaries

  سند علمی۲۰۱۳WCREIstván Haller, Asia Slowinska, Herbert Bos

  Many existing techniques for reversing data structures in C/C++ binaries are limited to low-level programming constructs, such as individual variables or structs. Unfortunately, without detailed information about a program’s pointer structures, forensics and reverse engineering a

• floodlight - A high-level, data-driven sports analytics framework

  مقاله‌ی دسترسی آزاد۲۰۲۲Journal of open source software['Dominik Raabe', 'Henrik Biermann', 'Manuel Bassek', 'Wohlan, Martin', 'Rumena Komitova', 'Robert Rein', 'Groot, Tobias Kuppens', 'Daniel Memmert', '']

• A High Level Implementation of a High Performance Data Transfer Interface for NoC

  سند علمی۲۰۱۵Mansi Jhamb, R. K. Sharma, A. K. Gupta

  The distribution of a single global clock across a chip has become the major design bottleneck for high performance VLSI systems owing to the power dissipation, process variability and multicycle cross-chip signaling. A Network-on-Chip (NoC) architecture partitioned into several

• Wildlife Wrangler: A high-level data processing framework that supports the utilization of species occurrence data for biogeographical analyses

  مقاله‌ی دسترسی آزاد۲۰۲۲Biodiversity Information Science and Standards['Nathan M. Tarr', 'Abigail Benson', 'Matthew J. Rubino', '']

  Biodiversity data are more findable and accessible to research communities due efforts over the last 20 years by infrastructures. Species occurrence especially valuable conservation biogeography analyses, such as U.S. Geological Survey's Gap Analysis Project (GAP), which assesses

• [Her89] Maruice Herlihy. A methodology for implementing highly concurrent data structures. In ACM

  سند علمی۱۹۹۱Thomas E Anderson, Gary Graunke, Pradeep Sindhu, Jean Marc Frailong

  We present a mechanism for making a scalable spin lock protocol the MCS lock recoverable thereby ensuring that a lock never becomes permanently unavailable even if one or more processes using the lock die This is achieved by modifying the original protocol to write additional inf

• A methodology for implementing highly concurrent data structures

  مقاله‌ی دسترسی آزاد۱۹۹۰ACM SIGPLAN NoticesM.Herlihy