Search Results for "computer science projects" - Page 5
Sort By:
214 projects for "computer science projects" with 2 filters applied:
-
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.
-
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
TICO
Interactive communication boards for people with severe disabilities.
TICO is currently a part of ARASUITE!!!! Please, look for ARASUITE in Sourceforge!!!! https://sourceforge.net/projects/arasuite/ TICO is a tool for the design and execution of interactive communication boards. Communication boards are highly used in augmentative and alternative communication (AAC) environments. -
2
QVision: Computer Vision Library for Qt
Computer vision and image processing library for Qt.
This library contains among other things a set of graphical widgets for video output, performance evaluation and augmented reality. The library also provides classes for several data types usually required by computer vision and image processing applications such as vectors, matrices, quaternions and images. Thanks to a large number of wrapper functions these objects can be used with highly efficient functionality from third party libraries such as OpenCV, GNU Scientific Library,... -
3
Shobhit-Improved String Search
SHOBHIT-Improved String Search is new improved string search algorithm
In Computer Science, SHOBHIT-Improved String Search Algorithm is a string searching algorithm created by SHOBHIT UPADHYAYA in August, 2013. He is working as a Software Developer in Bangalore India. “This algorithm uses the first, last, mid1 and mid2 index of the substring for a pattern search.” TIME and SPACE Complexity: For a text of length n and substring of length m. -
4
omegat-plugins
OBSOLETE AS OF OMEGAT 3.0.3. DO NOT USE.
OBSOLETE AS OF OMEGAT 3.0.3. DO NOT USE. Third-party plugins for OmegaT (https://sourceforge.net/projects/omegat) -
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.
-
5
CocoCommons
Modern, cross platform library of functions used in CoCo software
This is a modern set of libraries intended for use in software related to the Tandy Radio Shack Color Computer (the CoCo). Some functionality may also be useful in more general Motorola 6809 centered projects. CocoCommons provides a set of libraries for common tasks such as reading DECB and RBF filesystems, interpretting common file formats, and displaying CoCo-like screens. These are used extensively in the DriveWire 4 project and the upcoming nineserver project. ... -
6
A parallel-programming framework for concurrently running large numbers of small autonomous jobs, or microthreads, across multiple cores in a CPU or CPUs in a cluster. Each microthread is conceptually similar to a task in Ada and it is much lighter weight than an operating system thread. SpikeOS was designed to handle millions of microthreads, for example in a neural network hosting millions of spiking model neurons. SpikeOS handles microthread scheduling, synchronization, distribution...
-
7
Network Emulator
Distributed Network emulation tool for high rate packet
I need your help: In order to make this framework easier and more useful, I need your contribution. The idea behind this framework is to develop a GUI like GNS3 and make this framework more stable. So if you are interested and have C/C++ programming skills, please contact me at zahid.med@gmail.com This framework allows to emulate a network by managing ethernet packets coming from two kind of interfaces: UDP and virtual network card. This tool is similare to dynamips (GNS3) but it can... -
8
The project contains a collection of general-purpose Java utility classes including unique ID generators, thread pool management classes, as well as various utility classes for email and testing.
-
9
Approximate Subgraph Matching Algorithm
Approximate Subgraph Matching Algorithm for Dependency Graphs
The subgraph matching problem (subgraph isomorphism) is NP-complete. Previously, we designed an exact subgraph matching (ESM) algorithm for dependency graphs using a backtracking approach (http://esmalgorithm.sourceforge.net). 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,... -
AI-powered service management for IT and enterprise teamsGive your IT, operations, and business teams the ability to deliver exceptional services—without the complexity. Maximize operational efficiency with refreshingly simple, AI-powered Freshservice.
-
10
OGEMA allows software applications aiming at energy management and energy efficiency to be executed on an embedded computer (the Gateway) connected to building automation systems. OGEMA wiki https://www.ogema-source.net/wiki/
-
11
Orange Effort Estimation Tool
Estimate software development effort with 5 different methods
This tool enables software development effort estimation using 5 different methods. All industry standard methods are used. COCOMO II This is a model for effort estimation. The use of the model enables effort estimation from non-experts (e.g. not developers). Work Breakdown Estimation This is an effort estimation method based on expert judgment. Two options are available: Delphic Oracle and Three Point Estimation. Analogy / Comparison Estimation This method... -
12
Development environment for Karl Fant's Invocation Programming Language described in "Computer Science Reconsidered" (Wiley, 2007)
-
13
A translation tools suite for Computer-Aided Translation / Computer-Assisted Translation (CAT). A translation processor with translation memory, machine translation and project support, bitext aligner/converter, TMX validator, and others.
-
14
Exact Subgraph Matching Algorithm
Exact Subgraph Matching Algorithm for Dependency Graphs
The subgraph matching problem (subgraph isomorphism) is NP-complete. We designed a simple exact subgraph matching (ESM) algorithm for dependency graphs using a backtracking approach. The total worst-case algorithm complexity is O(n^2 * k^n) where n is the number of vertices and k is the vertex degree. 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... -
15
Sorting Algorithms
An educational demo of how sorting algorithms work.
...The user can modify the speed of execution and the type of data to sort and execute it step by step. The tooltip of each algorithm's box shows the source code that is executed and a little explanation got from wikipedia. This application is aided to computer science students who want to better understand how the algorithms work. -
16
jSET - Java Software Evolution Tracker is a software visualization tool that allows practitioners to assess the magnitude of changes across the versions of a software system.
-
17
SINGHAL mutual exclusion in FreeBSD
Design and Implementation of the Singhal token based mutual exclusion
[ Design and Implementation of the Singhal token based mutual exclusion algorithm in kernel-space of FreeBSD ] | Data & Network Security Lab (DNSL) | Room 501, Floor 5, | Department of Computer Engineering | Sharif University of Technology | Azadi Ave., Tehran, Iran Vahid Khodabakhshi <vkhodabakhshi@ce.sharif.edu> Vahid Ranjbar <vranjbar@ce.sharif.edu> Also see the Acknowledgement file Please send bugs to our e-mail -
18
A graphical IDE and Model Driven Architecture for designing Overlay Networks and Peer-to-Peer systems.
-
19
SimpleJ is a collection of easy to use multi-purpose Java beans. They provide commonly used methods for handling I/O, arithmetic, and general commonly used algorithms used in computer science. Intended audience: programmers and computer science students.
-
20
PortableLatex is LaTeX without installation; you download and use it straight away, without changing a byte of your system. Plus a complete suite of apps to comfortably edit, view, compile and handle latex or tex projects, glued by some scripting.
-
21
widi is a form targeted to Open Source Developers that processes automatically their input and shows the results graphically. It is part of a project at the "Computer Science and Society" Institute at the Technical University of Berlin.
-
22
An open-source corpus analysis class library written in C#. GUI of Tenka Text 0.1.3 comes with Wordlister - an advanced, extremely fast graphical wordlist tool and a simple regex concordance tool. Tenka Text - the open-source answer to WordSmith Tool
-
23
BlueDS is a library that contains the implementation of frequently used data structures and algorithms in Computer Science. BlueDS is designed to be fast and efficient.
-
24
GeneThello (read jə-ˈne-ˈthe-lō), is an acronym for genetic othello, an othello (reversi) playing program which based on Genetic Algorithm (GA). In principle GeneThello consist of an othello program and a genetic algorithm system.
-
25
Object oriented reusable software classes designed to be used to construct larger software projects developed in multiple software languages.
