Search Results for "sourceforge.net"
Sort By:
Showing 6 open source projects for "sourceforge.net"
View related business solutions-
Earn up to 15% annual interest with Nexo.Generate interest, access liquidity without selling, and execute trades seamlessly. All in one platform. Geographic restrictions, eligibility, and terms apply.
-
Earn up to 15% annual interest with Nexo.Generate interest, borrow against your crypto, and trade a range of cryptocurrencies — all in one platform. Geographic restrictions, eligibility, and terms apply.
-
1
FUMOLA - Functional Mock-up Laboratory
An FMI-based co-simulation framework.
...FUMOLA is developed on top of the Ptolemy II framework (https://ptolemy.eecs.berkeley.edu) and the FMI++ library (http://fmipp.sourceforge.net). The online documentation of FUMOLA is available here: https://sourceforge.net/p/fumola/wiki/Home/ -
2
TreeLayout
Efficient and customizable TreeLayout Algorithm in Java, for NetBeans
Efficiently create compact, highly customizable tree layouts - Based on Walker's algorithm with enhancements suggested by Buchheim, Jünger, and Leipert the software builds tree layouts in linear time. I.e. even trees with many nodes are built fast. Downloads are available at https://sourceforge.net/projects/treelayout/files/. For detailed documentation look at the TreeLayout web site http://treelayout.sourceforge.net/. Development for TreeLayout has moved to https://github.com/abego/treelayout/. -
3
jmathstudio - Java Image/Signal toolkit
Java toolkit for discrete Image and Signal processing.
...It is simple to use, portable, light (~300 Kb), extendable and free. Full source code available at https://github.com/bhavyaajani/jmathstudio Android compatible JMathStudio is available @ https://sourceforge.net/projects/jmathstudio-android/ -
4
Approximate Subgraph Matching Algorithm
Approximate Subgraph Matching Algorithm for Dependency Graphs
...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. Approximate Subgraph Matching-based Literature Mining for Biomedical Events and Relations. PLOS ONE, 8:4 e60954, 2013. -
Run applications fast and securely in a fully managed environmentRun frontend and backend services, batch jobs, deploy websites and applications, and queue processing workloads without the need to manage infrastructure.
-
5
Exact Subgraph Matching Algorithm
Exact Subgraph Matching Algorithm for Dependency Graphs
...We have demonstrated the successful usage of our algorithm in three biomedical relation and event extraction applications: BioNLP 2011 shared tasks on event extraction, Protein-Residue association detection and Protein-Protein interaction identification. This Java implementation implements our ESM algorithm. See README file: https://sourceforge.net/projects/esmalgorithm/files/ If you use our ESM implementation to support academic research, please cite the following paper: Haibin Liu, Vlado Keselj, and Christian Blouin. Exploring a Subgraph Matching Approach for Extracting Biological Events from Literature. Computational Intelligence, 2013. -
6
Enumerations
This project is no longer maintained.
This project is no longer maintained. Instead use my Java util lib: http://sourceforge.net/projects/util-lib/
- Previous
- You're on page 1
- Next
