Search Results for "jack-graph" - Page 63
Sort By:
Showing 2173 open source projects for "jack-graph"
View related business solutions-
$300 Free Credits to Build on Google CloudPut your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.
-
MongoDB Atlas runs apps anywhereMongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
-
1
Angur is a XML visualization utility which helps users visualize XML files in node graphs as well as generating XML visually, without any XML knowledge.
-
2
GenGMF is a model driven generator framework for the Eclipse GMF graph and map models. It will generate large models from a small template model for you. It is based on Eclipse GMF, AspectJ and openArchitectureWare.
-
3
MIDI Arpeggiator w/ JACK Tempo Sync. Alpha status. Source tarball for alpha 0.3.3 release, and SVN access are available.
-
4
slurry is a simple python program that plays sounds at random. it is being created primarily for an experimental film screening in June 2010. it will continue to be developed after this.
-
Ship Agents FasterGemini 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.
-
5
This is project Malaria SAIYOK. Development for collect data malaria disease. In case positive can input to EP3 the Malaria SAIYOK. The system can generate report by infected case.
-
6
SIFA (Secure Information Flow Analyser) uses a graph-based approach to reason about the possible vulnerabilities of a system from an information security perspective, supporting multiple views over the system. SIFA is an experimental prototype.
-
7
.Net Checker checks all code dependencies in .Net projects to ensure a stable architecture - up to multi-million LOC source trees. Moreover, it can produce flexible DOT-based dependency graphs.
-
8
This is a simple webcrawler for FaceBook (TM) written in Java. The crawler will surf the public user pages (this means that you do not need to provide ann account) to reconstruct the friendship graph for further studies and analises
-
9
Multi-Partite Community Detection - community detection (aka graph clustering) in k-partite k-uniform hypergraphs
-
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.
-
10
This tool provide the all the possible paths & shows linearly independent paths for a graph. This tool is use full for the white box testing.
-
11
The aim of the PL-PSF project is to create a generic domain-independent combinatorial problem solver. It uses a petri-nets based model to represent the problems and problem decomposition/abstraction with graph topology analysis to solve them.
-
12
-
13
Software for graphs visualization, encouraging graph algorithms implementation. Aimed at students who want to code their own algorithms and see a graphical representation of it working.
-
14
A program for searching of automorphisms in a given graph. It uses the 2-dimensional Weisfeiler-Lehman method to first classify the vertices. Afterwards, searches for automorphisms using a method proposed by Manindra Agrawal.
-
15
-
16
Glass Brain is a tool specifically designed for displaying neural connections within the human brain given multidimensional scan data and a connectivity graph. This project benefits from Qt, VTK, ITK, and CMake.
-
17
Extcalc is a multifunctional scientific graphic calculator for linux with features like graph drawing, graph analysis and calculating scientific functions including differentiation, integration and logic functions.
-
18
-
19
Parallelized (threaded) software to enumerate all maximal subgraphs of a graph that exceed a specified density, even if they overlap.
-
20
This simple project provides a way to efficiently calculate the actual memory use of any Java object. The class makes use of the JVMs own instrumentation support to calculate the object memory use in a portable way.
-
21
EasyFlow is a non-graph based BPM engine. Its definition bases on task (named Action in EasyFlow). It could be changed without stopping the runing of business process beacuse of it so simple definition.
-
22
JPeek is a graphical tool and library for reflection-based runtime inspection of the object graph in Java.
-
23
-
24
-
25
