Search Results for "tree" - Page 32
Sort By:
Showing 1455 open source projects for "tree"
View related business solutions-
Custom VMs From 1 to 96 vCPUs With 99.95% UptimeLive migration and automatic failover keep workloads online through maintenance. One free e2-micro VM every month.
-
Cut Data Warehouse Costs by 54%BigQuery delivers 54% lower TCO with exabyte scale and flexible pricing. Free migration tools handle the SQL translation automatically.
-
1
fusie
Fuzzy scala inference engine
Rewriting from Java to Scala and improving my university project on course Artifical Intelligence Systems. About project in russian: http://brunneng.blogspot.com/2013/06/fuzzy-scala-inference-engine-fusie.html Can be used from maven: <dependency> <groupId>net.sf.brunneng.fusie</groupId> <artifactId>fusie</artifactId> <version>0.8.1</version> </dependency> -
2
It is a C# library that implementes most binary tree algorithms such as insertion algorithm, deletion algorithms, and searching a node in a binary search tree. It also can conduct the preorder and postorder traversal functions.
-
3
Octree Method For Particles
simulation of particles using an oct-tree
Similiar to the fast multipole method i guess. I realized that simulating a very large number of particles in e.g. electromagnetic sims can run into growing i/o demands. This is a way to overcome that hurdle. the low-level "octets" can be distributed among a cluster of computers, organized in a grid. they don't have to send each other their whole dataset - only a zoomed out image of it. the further away, the more zoomed out. thus, i/o traffic is greatly reduced. combine this with the... -
4
GeDBIT
General Distance Based Index Tree
-
Demo Series - Small Business Backup By VeeamWatch this on-demand demo series and learn how to protect your Microsoft 365 data with clear, simple, actionable steps that are easy to implement for businesses of all sizes.
-
5
iOVFDT
iOVFDT algorithm of incremental decision tree
How to extract meaningful information from big data has been a popular open problem. Decision tree, which has a high degree of knowledge interpretation, has been favored in many real world applications. However noisy values commonly exist in high-speed data streams, e.g. real-time online data feeds that are prone to interference. When processing big data, it is hard to implement pre-processing and sampling in full batches. To solve this trade-off, we propose a new decision tree so called incrementally optimized very fast decision tree (iOVFDT). ... -
6
iwnbtjl
A Java NBT library with freedom.
The Ian Watters Named Binary Tag Java Library (IWNBTJL for short) is a Java library that allows work with the Named Binary Tag format created by Notch with any project of your's (please note, no one owns NBT). Written off of the JNBT library (http://jnbt.sourceforge.net/), this contains usage improvements, however is not too different from the original library. -
7
This is a Verilog/AMS 1.3 Parser Frontend. Input files are preprocessed and parsed, internally stored in a VPI-object-tree representation. No elaboration or synthesis is performed.
-
8
MassGeotagger
MassGeotagger lets you to geotag sets of JPG Photos with GPX logs
MassGeotagger lets you select a photo, a photo folder or a folder tree and update the latitude and longitude coordinates in the EXIF data of the selected photos. To get the GPS coordinates, the method of choice is to select one or several GPX files and set the difference of time between APN time saved in EXIF data and GPS time. However other strategies to match JPG and GPS coordinates are available : by selecting one of the GPX waypoint, by selecting a point on the map or by user input. ... -
9
JoomlaGen
Joomla extension for GRAMPS database
A Joomla! component/module. The component uses an upload of the GRAMPS xml database export and shows genealogical information and overviews. The component and the module are compatible with Joomla 1.5 The highest version (version 0.3) is compatible with GRAMPS 3.3.0 and higher. Users of lower versions of GRAMPS should use version 0.2. -
Host LLMs in Production With On-Demand GPUsDeploy your model, get an endpoint, pay only for compute time. No GPU provisioning or infrastructure management required.
-
10
RuzzleSolver
Takes in a ruzzle input and solves it
...Runs a DFS on the Ruzzle grid and at each instance checks if the word formed is a valid one. 2. Since the size of a grid is just 4 x 4, optimizations (such as using a suffix tree) aren't that important. 3. The total list of possible words is obtained fairly quickly. Less than 10 seconds on an i7 machine (without using any form of parallelization or multithreading). 4. The TWL06 wordlist, same as the one used by Ruzzle, is used as the dictionary. 5. The automated swiping is done by controlling the mouse pointer and getting it to move around automatically. ... -
11
...The main focus of this Framework lies on fast Algorithms for NP-Complete problems. We aim at providing algorithms that run Fixed Parameter Tractable algorithms (utilizing Kernelization where possible), Tree-Width based, Randomized Algorithms, etc. in parallel. So the aim of the project is to give you simple interfaces to the best algorithms for these problems.
-
12
Java Biomorph Simulator
Simulates biomorph evolution in real-time
This program is an evolution simulator that simulates computer generated organisms called biomorphs. Each biomorph is a recursively drawn tree and contains 9 genes. The genes control the attributes of the biomorph, such as its speed and shape. In this program biomorphs compete against each other, creating offspring as they live. Each offspring is a mutated version of its parent. When a biomorph creates an offspring, its energy is halved. -
13
B Tree First-Fit malloc()
B Tree First-Fit Memory Allocator
BTFF Features O(log n) time with First-Fit behavior, as n is the number of allocated & free blocks. No boundary tag. Separation between payload and bookkeeping meta data. It does not use any free payload area. As of v1.0, payloads are located in data segment area which is acquired by brk(), and bookkeeping meta data are located in separated area which is acquired by mmap(). Small bookkeeping meta data overhead. Applicable to any kind... -
14
CLAW is a C++ Library providing various tools in different domains, like a Tweener framework, Bézier curves manipulation, a map with multiple value types, a binary search tree container implemented as an AVL and an implementation of the sockets as std::stream. The library also includes a set of classes to easily load and write png, jpeg, gif files and other image formats. Finally, a part of the library is devoted to artificial intelligence in games and includes a generic alpha-beta algorithm. Each module is provided with an example program.
-
15
DupLichaSe
A Fast Duplicate File Detector with graph based semi-automatic cleaner
DupLichaSe is a very fast Duplicate File Detector that uses inductive heuristics to detect duplicate files very fast; based on content! DupLichaSe stands out from EVERY other Duplicate file detection Software because of it's graph based semi-automatic selection system. ... after finding 100s of duplicate files, do you have to go through some manual and possibly laborious process of deleting the duplicates? ...or is there a way for the Software to learn and do most of it for you in a SAFE... -
16
BlackLight - XML Viewer
A syntax-removing XML viewer with tree navigation
An XML viewer aimed at making the data easily browse-able. Licensed under GPL v3 Simple Description: https://tldrlegal.com/license/gnu-general-public-license-v3-%28gpl-3%29 Full: https://www.gnu.org/copyleft/gpl.html I developed this for use in reviewing various data files for mechanical engineering analysis software I use. I also use it as an aide when writing XML parsing programs. -
17
eix can access Gentoo portage ebuild information and description very quickly (using a local cache). It can also be used to access information on installed packages, local settings, and local and external overlays, and informs about changes in the tree.
-
18
indevIDE
A wxMax based IDE for the programming language BlitzMax
IndevIDE is an open source IDE that uses wxMax (wxWidgets 3.0) and a SQLite database to provide you with the essential features of an IDE like autocompletion, call tips and quick documentation access on Windows and Linux. ~~~~~~~~~~~~~~~~~ This Program uses Code from MaxIDE CE for building and debugging as well as some of its icons (https://sourceforge.net/projects/blitzmax-ide/) Some of Burcey's Modules (regex,libxml,dbsqlite,boost) ... -
19
tree-ident
Arborial mapping
Map trees, and capture forest health. Identify tree species from photographs (taken on a smartphone, for example) using pattern recognition to match against a database. Tied in with GIS/GPS information to provide ecological/environmental mapping information. -
20
JavaFX maven pom explorer
Maven POM explorer
Explore a maven project to discover all nested modules, all properties and dependencies. Execute goals directly. -
21
arbre genealogique
school project
This project have the purpose to discover how to work in team. The project is to create a genealogic tree and stock it. -
22
Binary Tree Sort
An implementation of Binary Tree Sort
An implementation of the Binary Tree Sort sorting algorithm. -
23
TopiaryExplorer has moved to GitHub. Find the new project info page here: https://github.com/qiime/Topiary-Explorer. If you need help or would like to add a bug/feature request, please do so there.
-
24
Cost-sensitive Classifiers
Adaboost extensions for cost-sentive classification
Adaboost extensions for cost-sentive classification CSExtension 1 CSExtension 2 CSExtension 3 CSExtension 4 CSExtension 5 AdaCost Boost CostBoost Uboost CostUBoost AdaBoostM1 Implementation of all the listed algorithms of the cluster "cost-sensitive classification". They are the meta algorithms which requires base algorithms e.g. Decision Tree Moreover, Voting criteria is also required e.g. Minimum expected cost criteria Input also requires to load an arff file and a cost matrix (sample arff and cost files are uploaded for users' reference) This extension uses weka for classification and generates the classification model along with confusion matrix. For given dataset and cost matrix -
25
