Showing 16 open source projects for "data structures"

View related business solutions
  • $300 Free Credits for Your Google Cloud Projects Icon
    $300 Free Credits for Your Google Cloud Projects

    Start building on Google Cloud with $300 in free credits. No commitment, no credit card required until you're ready to scale.

    Launch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
    Start Free Trial
  • Our Free Plans just got better! | Auth0 Icon
    Our Free Plans just got better! | Auth0

    With up to 25k MAUs and unlimited Okta connections, our Free Plan lets you focus on what you do best—building great apps.

    You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
    Try free now
  • 1
    TXM

    TXM

    Unicode XML TEI text analysis platform

    TXM is a free and open-source cross-platform Unicode & XML based text analysis environment and graphical client, supporting Windows, Linux and Mac OS X. It can also be used online as a J2EE standard compliant web portal (GWT based) with access control built in. DOWNLOAD LATEST VERSION OF TXM : http://textometrie.ens-lyon.fr/spip.php?rubrique61&lang=en TXM offers a comprehensive range of analysis tools (concordances, collocate search, frequency lists, etc.) based on the powerfull CQP...
    Leader badge
    Downloads: 8 This Week
    Last Update:
    See Project
  • 2

    Divide and Conquer Treemaps

    Divide and Conquer Treemap Visualisation

    The project develops new new techniques and algorithms for quickly partitioning and visualizing very large hierarchical structures within a variety of arbitrary shapes and space using Divide and Conquer approach for Treemaps. Related publications: https://www.sciencedirect.com/science/article/pii/S1045926X1500066X https://dl.acm.org/doi/pdf/10.1145/2493102.2493112
    Downloads: 0 This Week
    Last Update:
    See Project
  • 3
    D0rganizer

    D0rganizer

    Program to manage data and information

    Store collected information and data properly using D0rgnizer (The organizer). Create cases, folders, files, and insert images. Compare information between files, and export data to share with your team. Useful for data collection in investigations, ethical hacking, and more.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 4
    Limada
    Limada (Linked Marked Data) is a framework for managing relationships of data in non-hierarchical structures, where the individual elements are interconnected in complex ways. The philosophy behind: Information is connection, is relationship of data.
    Downloads: 0 This Week
    Last Update:
    See Project
  • Ship Agents Faster Icon
    Ship Agents Faster

    Transform your applications and workflows into powerful agentic systems at global scale.

    Gemini Enterprise Agent Platform lets you rapidly build, scale, govern and optimize production-ready agents grounded in your organization's data. The platform enables developers to build custom or pre-built agents for virtually any use case. New customers get $300 in free credits.
    Get Started Free
  • 5
    concordia

    concordia

    Powerful search library, best suited for computer-aided translation

    ...It uses a RAM stored index, which takes up approximately 600MB of memory for a corpus of 2 million sentences. It is based on the idea of a suffix array, enhanced by the presence of other auxiliary data structures. The effects are stunning - Concordia is able to do simple substring lookup at the pace of 5000 queries per second (on personal PC) - a speed which can not be achieved by any other search library. Moreover, Concordia can perform its own "concordia search". For a given input sentece, all substring matches covering this sentence are retrieved. ...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 6

    Text Analyzer

    Text analyzing software

    An application developed in C using the list and the AVL tree data structures, which analyzes a text (.txt file) giving the following information as an output: 1. the total occurrences of every word in the text 2. the exact line of every occurrence of every word 3. the exact position in the line of every occurrence of every word 4. the exact paragraph of every occurrence of every word 5.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 7
    Graphical Grammar Studio

    Graphical Grammar Studio

    An user friendly grammar tool for natural language processing tasks

    Full documentation with tutorials is included in the download package. Graphical Grammar Studio is a tool for applying grammars which behave as words acceptors/consumers and annotators. GGS grammars can be used to find and annotate sequences of words which respect certain conditions, in a given input. Its purpose is for creating NLP tools like phrase chunkers, named entity finders, pronoun co-reference solvers etc. A grammar is represented by a state machine which can be visualized, edited...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 8
    ParaSim

    ParaSim

    Parallelized calculation of molecular similarities

    Diversity assessments and comparisons of large compound databases require calculating similarities of millions of compounds in an affordable time. ParaSim addresses this challenge by parallelizing the calculations according to the number of computing cores available on a single machine. It is optimized for the throughput of very large numbers of query structures against very large numbers of reference structures. As as special feature, ParaSim allows to store and and to access frequently...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 9

    dbtesma

    efficient data generation for benchmarks and performance analysis

    Highly efficient Data Generator for Benchmarks and Algorithm Performance Analysis. Supports fully configurable schemata as well as meta structures like Foreign Keys and Functional Dependencies.
    Downloads: 0 This Week
    Last Update:
    See Project
  • Custom VMs From 1 to 96 vCPUs With 99.95% Uptime Icon
    Custom VMs From 1 to 96 vCPUs With 99.95% Uptime

    General-purpose, compute-optimized, or GPU/TPU-accelerated. Built to your exact specs.

    Live migration and automatic failover keep workloads online through maintenance. One free e2-micro VM every month.
    Try Free
  • 10
    Analysis

    Analysis

    Application to creating charts.

    The goal of project is delivering useful and simple tools to creating charts. Functionality is provided by modules/plugins (OSGi technology). It allows you to create your plugins or customize Analysis application (by changing installed plugins in application). The Application, thanks to JAVA technology, is portable on the most operating system. In Files page you can find the application and also patches to its.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 11
    An implementation of "k-Way Merging" as described in "Fundamentals of Data Structures" by Horowitz/Sahni. NOTE: This project has been moved to http://code.google.com/p/kway/
    Downloads: 0 This Week
    Last Update:
    See Project
  • 12
    Book-A-Lyze is an open source web application for analysis and visualization of social structures at Facebook. The project is part of the study course “Media Management and Production” at the University of Applied Sciences, Kaiserslautern.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 13
    UDA stands for Universal Descriptive Algebra. It consists of a Java package handling universal algebras and relational structures as description systems.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 14
    The aim of MIEX (Metadata and Information Extractor from small XML documents) is to create a wrapper for the Stanford Parser, to extract and store metadata (syntactic structures, relationships among words...) from simple XML documents.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 15
    The goal of this project is to create a set of workflows that treat tcpdumps/packet captures as just another sort of data to be loaded into relational structures and manipulated using the well-established methods of relational databases.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 16
    JavaMatch is an engine that can search inside a runtime Java data structures, and look for objects that best match the criteria that you specify. The extensive query mechanism allows for highly customizable tuning of your match queries.
    Downloads: 0 This Week
    Last Update:
    See Project
  • Previous
  • You're on page 1
  • Next
Auth0 Logo