Search Results for "data structure project in java"
Sort By:
Showing 41 open source projects for "data structure project in java"
View related business solutions-
Our Free Plans just got better! | Auth0You 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.
-
Get Avast Free Antivirus | Your top-rated shield against malware and online scamsOur antivirus software scans for security and performance issues and helps you to fix them instantly. It also protects you in real time by analyzing unknown files before they reach your desktop PC or laptop — all for free.
-
1
Hello Algorithm
Animated illustrations, one-click data structure
Animated illustrations, one-click data structure and algorithm tutorials. This project aims to create an open source, free, novice-friendly introductory tutorial on data structures and algorithms. The whole book uses animated illustrations, the content is clear and easy to understand, and the learning curve is smooth, guiding beginners to explore the knowledge map of data structures and algorithms. The source code can be run with one click, helping readers improve their programming skills... -
2
JCTools
Java Concurrency Tools for the JVM
Java Concurrency Tools for the JVM. This project aims to offer some concurrent data structures currently missing from the JDK. There’s more to come and contributions/suggestions are most welcome. JCTools has enjoyed support from the community and contributions in the form of issues/tests/documentation/code have helped it grow. JCTools offers excellent performance at a reasonable price (FREE! under the Apache 2.0 License). It’s stable and in use by such distinguished frameworks as Netty, RxJava... -
3
MOA - Massive Online Analysis
Big Data Stream Analytics Framework.
A framework for learning from a continuous supply of examples, a data stream. Includes classification, regression, clustering, outlier detection and recommender systems. Related to the WEKA project, also written in Java, while scaling to adaptive large scale machine learning. -
4
This project is a reasoner for the description logic EL+. It computes the concept subsumption hierarchy. It is an OWL 2 EL reasoner.
-
Simplify IT and security with a single endpoint management platformNinjaOne automates the hardest parts of IT, delivering visibility, security, and control over all endpoints for more than 20,000 customers. The NinjaOne automated endpoint management platform is proven to increase productivity, reduce security risk, and lower costs for IT teams and managed service providers. The company seamlessly integrates with a wide range of IT and security technologies. NinjaOne is obsessed with customer success and provides free and unlimited onboarding, training, and support.
-
5
Fast stable sorting in Delphi
Routines to sort large arrays of various types, simple and Tobject.
Significant gains in processing times when sorting arrays with structure in the data. Pre-sorted arrays with relatively few modifications may be sorted 20-30 times faster than Delphi's default QuickSort. The project includes a test suite. -
6
OverlappingTreesPlainMap
The utility for quickest manipulations with difficult data.
This is Java library for working with overlapping trees both as with plain memory and as with hierarchical structure, with quick access to any levels and branches of tree (<page><...><section><line><word>tooLongWordForCurrentLi</line></page><page><line>neAndSectionTwoPages</word></line></section><...></page> (incorrect in classic XML)). There supported the cross-references (from="@leftPanel#template" target="$template"); cursors;copying and removing of parts; functionality to index and search... -
7
This site hosts the source code for C++ version of the Broker for SBW, NOM module, advanced simulation suite, analysis applications and model editors.
-
8
EntOpt Layout
Relative entropy optimization network layout plugin
The goal of this project is to implement a graph layout / network visualization algorithm as a Java plugin for Cytoscape (http://cytoscape.org/), using a recently published relative entropy optimization based method, called Unified Data Representation (Kovács IA et al. Sci Rep. 2015). If you are using the plugin, please cite: Ágg B, Császár A, Szalay-Bekő M, Veres DV, Mizsei R, Ferdinandy P, Csermely P and Kovács IA (2019) The EntOptLayout Cytoscape plug-in for the efficient visualization... -
9
Algorithm Database
Efficient Algorithms implemented in Java
The Aim of this project is to provide a collection of reusable Algorithms which can be used effectively in different scenarios. Algorithm implementations are in Java. Objective here is to implement algorithms which should be more efficient than the JDK implementation and also to create a platform for the researchers who works on Data Mining, Encryption algorithms, ect.. to collaborate and contribute to this project. -
MongoDB 8.0 on Atlas | Run anywhereMongoDB 8.0 brings enhanced performance and flexibility to Atlas—with expanded availability across 125+ regions globally. Build modern apps anywhere your users are, with the power of a modern database behind you.
-
10
Triepocalypse
A trie data structure extracted from the typing game Typocalypse.
The typing game Typocalypse (https://code.google.com/p/typocalypse/source/browse/#hg/Trie) used a trie data structure which has been linked to separately from the game and has been of separate interest for some years now. It has now been given its own repository. A trie is a data structure used to find strings from their prefixes. After having stored strings in the trie, the trie will efficiently find all the strings which start with a particular prefix. Project was developed using C... -
11
deapheap
Deap is a doubly heap for both min and max number access.
A deap is a doubly priority queue for efficient data operations. Both insertion and deletion operations take O(log(N)) time. Access of min or max takes constant time. It can be useful when both min and max are needed in the queue. It can also be used in situations where the number of items is too large and items with low priorities can be dropped with keep memory footprint small. -
12
S-Match
S-Match is a semantic matching framework.
S-Match is a semantic matching framework. S-Match takes any two tree like structures (such as database schemas, classifications, lightweight ontologies) and returns a set of correspondences between those tree nodes which semantically correspond to one another. S-Match contains implementations of the semantic matching, minimal semantic matching and structure preserving semantic matching algorithms. S-Match applies as a solution in many fields, including: information integration... -
13
Flamingo Project
Workflow Designer, Hive Editor, Pig Editor, File System Browser
Flamingo is a open-source Big Data Platform that combine a Ajax Rich Web Interface + Workflow Engine + Workflow Designer + MapReduce + Hive Editor + Pig Editor. 1. Easy Tool for big data 2. Use comfortable in Hadoop EcoSystem projects 3. Based GPL V3 License Supporting Pig IDE, Hive IDE, HDFS Browser, Scheduler, Hadoop Job Monitoring, Workflow Engine, Workflow Designer, MapReduce. -
14
drvq
dimensionality-recursive vector quantization
drvq is a C++ library implementation of dimensionality-recursive vector quantization, a fast vector quantization method in high-dimensional Euclidean spaces under arbitrary data distributions. It is an approximation of k-means that is practically constant in data size and applies to arbitrarily high dimensions but can only scale to a few thousands of centroids. As a by-product of training, a tree structure performs either exact or approximate quantization on trained centroids, the latter... -
15
BinBase
BinBase is a software for the automatic analysis of Massspec data from
BinBase is a software for the automatic analysis of Massspec data from LECO GC-Tofs. All code and documentation has been moved to the google code site of this project: https://code.google.com/p/binbase/ And support is provided by the company coding and more, which can be reached under: contact@codingandmore.org -
16
Project provides a set of concurrent building blocks (Java & C/C++) that can be used to develop parallel/multi-threaded applications. Components are grouped into 4 categories: 1.Data Structures 2. Parallel Patterns 3.Parallel functions 4.Atomics and STM
-
17
This is a Java-based project for complex event extraction from text and co-reference resolution. Currently the code can read BioNLP shared task format (http://2011.bionlp-st.org/) and i2b2 Natural Language Processing for Clinical Data shared task format (https://www.i2b2.org/NLP/DataSets/Main.php). Event extraction includes finding events and the parameters for an event in a text. The method is based on SVM but other ML algorithms can be adopted. The method details are explained...
-
18
JSort is a library with some sorting algorithms implementation and related data structure. It has compare-based algorithms, linear sorting, graph sorting, priority based queue, and so on.
-
19
AlgoExplorer is a dynamic data structures viewer for Java. It allows the visualization of data structure of a Java program, allowing you to see how objects, handled by the algorithms, interact with each other and how they are related and linked. The project has been moved on: http://code.google.com/p/algoexplorer/
-
20
Don't hard-code data-structures for Artificial Intelligence (AI). Evolve them (and control flow) as cycles of arrays in arrays with size constraints based on other array sizes (at specific index) in terms of range, multiply, exponent, or permutation. No working code yet. Whats there now is an extension of GigaLineCompile which would become part of Human AI Net, but there are other projects to finish before I can come back to this one.
-
21
A Java library and set of tools to quickly and easily manipulate graphs (set of nodes and edges) and dynamic graphs. The principal trait of this library is its ability to manage (create, edit, layout, display) continuously evolving graphs. The development of this project now takes place on Github. Visit the official Graphstream website at http://graphstream-project.org
-
22
Seeds is a project which implements Data structure and Algorithms! We aim for speed, flexible and the easy to use!
-
23
Isolate Project is a straightforward data retrieval software that connects to popular relational database management systems and performs search operations based on the criteria specified. This project aims to speedup data retrieval operations.
-
24
This projects has the intent to take any file that has a header and any number of lines, take out the blank lines, the carriage return and the line feed, given as delimitation the "project number" format and generates a new clean file.
-
25
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/
