Search Results for "graph" - Page 34
Sort By:
Showing 1425 open source projects for "graph"
View related business solutions-
Go From AI Idea to AI App FastAccess Gemini 3 and 200+ models. Build chatbots, agents, or custom models with built-in monitoring and scaling.
-
Stop Storing Third-Party Tokens in Your DatabaseRolling your own OAuth token storage can be a security liability. Token Vault securely stores access and refresh tokens from federated providers and handles exchange and renewal automatically. Connected accounts, refresh exchange, and privileged worker flows included.
-
1
gc_hole_filling
Depth map hole filling using graph cuts
Code to fill missing holes in a depth map using a second-order smoothness prior. Implemented in matlab using graph cuts. Accompanies the paper "Herrera C., D., Kannala, J., Ladicky, L., Heikkila, J., Depth map inpainting under a second-order smoothness prior, SCIA, 2013" -
2
FastAlign.pl
FastAlign is a perl script which uses the heuristic method of tfasty
...There are extra nucleotides at the end of the hit string (option -diff and by default = 10), that allow to verify if the intron start with common rules (5'-GTGCGA-... for group II intron and after an exonic T for group I intron). If you have Emboss, you can genarate a graphic with option -graph 1. Dependencies: - Perl - Bioperl - UNIX system - tfasty - Emboss (if you want a graphic) -
3
Web graph compression
web graph compression algorithms implementation
This project contains the implementation of web graph compression algorithms developed in Technical University of Łódź by Institute of Applied Computer Science. -
4
GAuditor - The Graph Auditor Tool
A graph theory software for academic purposes
GAuditor is a software for use by students of graph theory. It helps solving problems like discovering the shortest paths from a single source vertex using Algorithyms like Dijkstra, Bellman-Ford and Floyd-Warshall, cycle detection, Eulerian circuit, Hamiltonian cycle, conectivity inspection, Breadth First Search, Depth First Search, etc. -
Enterprise-grade ITSM, for every businessFreshservice is an intuitive, AI-powered platform that helps IT, operations, and business teams deliver exceptional service without the usual complexity. Automate repetitive tasks, resolve issues faster, and provide seamless support across the organization. From managing incidents and assets to driving smarter decisions, Freshservice makes it easy to stay efficient and scale with confidence.
-
5
Stormons
Stormons is a powerful SAN mapping and monitoring program
Stormons is a powerful mapping and monitoring of san storage devices program. Designed to be fast, flexible, and rock-solid stable. Stormons runs on *NIX hosts and Windows and can monitor EMC² VNX Block and File, EMC² Symmetrix, NetApp FAS (7 mode), and Brocade switch devices. -
6
SysLinea
Linear Systems; Linear Regression; Non Linear Regression
...It is not compiling in my new installation of Lazarus. Most likely some unit, class or variable changed since Lazarus 1.6.x and I didn't want to spend the time yet to find out what changed. P.S. It is the Graph Unity that changed. Anyway, you probably want only the math parts and that don't change. Have fun! -
7
CoFlo
C and C++ control flow graph generator and analyzer
CoFlo generates Control-Flow Graphs from C and C++ source code. It can then output the graphs in a number of ways and perform various control flow analyses. NOTE: CoFlo has not been under active development for several years. At this time, I suggest you look into LLVM-based tooling to see if there is anything similar to CoFlo which will meet your needs. -
8
EarTeach desktop Ear Trainer
Complete Musical Ear Training HTML5 application.
... - Chords - Intervals - Scales Each category has a set of prebuild exercises, and user can create and save, its own customized exercise presets. All user results are stored, allowing to evaluate the current musical skills status, in each preset, or even display a graph of the progress along the time. -
9
LTS: Learning to Search
Discriminative subgraph mining by learning from search history
...The purpose of LTS is to find discriminative subgraphs, which are smaller graphs that are embedded in larger graphs that all share a certain trait. A discriminative subgraph can help to characterize a complex graph and can be used to classify new graphs with unknown traits. LTS is an improvement on other subgraph mining algorithms because it uses empirical data from the search history of a first pass to help weed out unpromising search directions. This allows a second pass to spend more time investigating promising areas of search to generate the most discriminative subgraphs more quickly than before. -
Earn up to 16% annual interest with Nexo.Generate interest, access liquidity without selling, and execute trades seamlessly. All in one platform. Geographic restrictions, eligibility, and terms apply.
-
10
The Network-Integrated Multimedia Middleware (NMM) is a flow graph based multimedia framework that allows to create distributed multimedia applications: local and remote multimedia devices or software components can be combined.
-
11
Component for structural analysis (graph-based concept and entity linking, segmentation and alignment of comparable texts)
-
12
Fltk_contour
2D and 3D contour and colour map of regular or scattered data
NOTE: This project was moved to: https://github.com/eetorres An easy scientific data visualization widget for the FLTK library. The widget is an OpenGL based contour visualizer for Linux, which allow you to built 2D and 3D graph of contour and colour map for a xy regular or scattered data set. There is a good example with the topographic data of Poland with 5902 data points to introduce yourself how to use it. There is not much documentation but it is easy to use. The input data are in XYZ format, where Z is a function of XY of the form Z=F(X,Y). The data file is in plain text format. -
13
Munin Contrib
Contributed stuff for munin (plugins, tools, etc...)
...The collection spans many languages (Shell, Perl, Python, Ruby) and styles, reflecting the breadth of Munin’s user base and the diversity of systems it monitors. While contributions vary in maturity, most include usage notes and configuration examples so you can get a graph online with minimal trial and error. The repository also serves as a learning resource: you can crib patterns for performance tuning, environment detection, and Munin’s plugin protocol. For operators, it dramatically shortens the path between “I wish I could graph X” and a consistent time-series chart in production. -
14
KDT provides domain experts with a simple interface to analyze very large graphs quickly and effectively without requiring knowledge of the underlying graph representation or algorithms. It provides a Python interface and can run on clusters.
-
15
SIGMA
Metagenomic Assembly
OperaMS is a metagenomic scaffolding pipeline that takes in a metagenomic scaffold graph and aims to output near-complete individual microbial genomes in your environmental sample. It uses the following strategy: a graph partitioning tool called Sigma is used to decompose the metagenomic scaffolding problem into distinct single genome scaffolding problems that are then solved by the single genome scaffolder Opera. -
16
KCachegrind visualizes traces generated by profiling, including a tree map and a call graph visualization of the calls happening. It's designed to be fast for very large programs like KDE applications.
-
17
steganoroute
Send steganographed text messages to mtr with fake hops in the network
Steganoroute is a tool to send steganographed text messages to another computer over the network. The receiver must make a traceroute to the sender using the mtr program (and pressing 'd' once to switch the display mode to the continuous graph). This tool, the sender, creates several fake hops and makes them answer the ICMP packets (or not) to write the letters one by one on the mtr client screen. -
18
Approximate Subgraph Matching Algorithm
Approximate Subgraph Matching Algorithm for Dependency Graphs
...We further designed an approximate subgraph matching (ASM) algorithm that is capable of detecting approximate subgraph matching based on a subgraph distance. Assume that the graph G and the subgraph Gs have m and n vertices, and km and kn edges respectively, the total worst-case algorithm complexity is O(m^n * n(n-1)/2 * km * log m). This Java implementation implements our ASM algorithm. See README file: https://sourceforge.net/projects/asmalgorithm/files/ If you use our ASM implementation to support academic research, please cite the following paper: Haibin Liu, Lawrence Hunter, Vlado Keselj, and Karin Verspoor. ... -
19
ParallelSim
ParallelSim is a parallel processor simulator written in java.
...The parameters like initial load, load offset, number of processors are declared as constants and can be changed directly in the source code to emulate different scenarios. It is also capable of plotting a graph at the end of each simulation to give an overview of how the simulation went. The output of simulation will vary from machine to machine depending upon the underlying hardware, for e.g., the timings will be different on a dual core and a quad core processor. Feel free to reach out to me if you have any suggestions or queries. -
20
sc2 battle.net spider
Player spider for Starcraft 2 battle.net data
A Starcraft 2 spider for all locales on battle.net; obtains ladder information, with persistence. Includes some functions to graph data and statistics, and show locale-wide ranks. REQUIRES PYTHON 2.6! -
21
VoIPGMap
Graph active VoIP calls on Google Maps.
A bash shell script which will read active call destinations in E.164 format from a source (such as Asterisk), then run the called number through some plain text and MySQL databases to find the best latitude/longitude match. It then creates a .html file with Google Maps API JavaScript code which will display a single call origination point and the active destinations (calls) on a Google Maps world map. -
22
X-Graph
An application that graphs and differentiates functions.
A C#.Net desktop application that accepts a standard function as input, then graphs and differentiates the given function. Extra info about the function will also be given, including extrema, domain/range, etc. As of now, this application is able to graph and differentiate any standard binomial function. Enjoy! Checkout: http://hifuture.org/products-open-source-projects/ for more open source applications! -
23
XDX Charts free
XDX Charts
XDX Charts is a DevExpress components extension regarding creation of diagrams. The provided component will allow you to quickly and conveniently add the charts to your application and connect them to your data sources. This product represents a visual component and an operation component with data sources. -
24
-
25
...Calvo (2012) “Using Information Extraction to Generate Trigger Question for Academic Writing Support”, 11th International Conference on Intelligent Tutoring Systems, Crete, Springer LNCS 7315, p.360-369. 2.Ming Liu, Rafael A. Calvo, Anindito Aditomo and Luiz Augusto Pizzato (2012), “Using Wikipedia and Conceptual Graph Structures to Generate Questions for Academic Writing Support”, IEEE Transactions on Learning Technologies, vol. 5, no. 3, pp. 251-263.
