Search Results for "sparse" - Page 6
Sort By:
Showing 181 open source projects for "sparse"
View related business solutions-
Build Agents and Models on One PlatformGemini Enterprise Agent Platform is Google Cloud's comprehensive platform for developers to build, scale, govern, and optimize agents and models. Choose from Google's most advanced models and third-party models like Anthropic's Claude Model Family.
-
$300 Free Credits for Your Google Cloud ProjectsLaunch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
-
1
Immutable Collections for Java
Immutable/Persistent Collections Library
...The library includes a singly linked (cons/cddr style) list/stack, an integer trie based indexed list, a 2-3 tree based random access indexed list, a 2-3 tree based map, a hash trie based map, and hash and tree based sets, and sparse arrays. All collections provide immutable Cursor as well as standard Iterator classes for looping through all elements. A utility class provides functional style algorithmic processing of Cursors including foldLeft, foldRight, collect, select, and reject. The 2-3 tree and integer trie classes are optimized for performance and can be used alongside java.util Collections when immutability is needed for safe data sharing. -
2
XMLFoundation
The fastest XML Parser that exists. Portable HTTP Services.
The fastest XML Parser that exists. A ground up HTTP Server and extendable multithreaded server. Examples for iPhone/Android/WinPhone also 64bit BigData examples for Windows and Linux. This 15 year old project is stable, it originated from the NCIS (National Clinical Info System) project, now used in many applications for portability, performance, and the core TCP and XML integration features in the library. Uses a textbook pure "Object Oriented" design and architecture that simplifies... -
3
Colt provides a set of Open Source Libraries for High Performance Scientific and Technical Computing in Java http://acs.lbl.gov/~hoschek/colt/ This project starteda as a port of the Colt core library to C#, but contains additional features.
-
4
-
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
Block Matrix library
Highly efficient implementation of BLAS for sparse block matrices.
Highly efficient implementation of BLAS for sparse block matrices. Accelerated using heavy-duty C++ meta-programming, SIMD instructions and GPU. -
6
KL1p
A portable C++ library for Compressed Sensing
KL1p is a portable C++ framework for handling sparse recovery of inverse problems of underdetermined linear systems, like in compressed sensing technique. -
7
ANGEL-Automatic differentiation Nested Graph Elimination Library is a template library using the Boost Graph Library and the Standard C++ Library; it provides sparse representations of c-graphs their dual line graphs and vertex, edge and face elimina
-
8
Graphlet kernel framework
Calculates similarity between neighborhoods of two vertices in a graph
...The graphlet kernel framework can be used for vertex (node) classification in graphs, kernel-based clustering, or community detection. If you use this framework, please cite the following paper: Lugo-Martinez J, Radivojac P. Generalized graphlet kernels for probabilistic inference in sparse graphs. Network Science (2014) 2(2): 254-276. -
9
DeconvDemo
An image deconvolution / deblur software
...image deconvolution / deblur software with non-blind deconvolution algorithm New: Add pregressive non-blined deconvolution Add blind kernel estimation Implemented mehtod: METHOD_WIENER, METHOD_TIKHONOV, METHOD_LUCY_RICHARDSON, METHOD_CONJUGATE_GRADIENT, METHOD_SPARSE_PRIOR, METHOD_GAUSSIAN_PRIOR, METHOD_NAIVE_EDGE_ENHANCEMENT, METHOD_CONVOLUTION, METHOD_PROGRESSIVE, METHOD_BLIND_KERNEL Improving: sparse prior blind deconvolution. PS: Please feel free to ask me any question and report bugs. -
Build Securely on AWS with Proven FrameworksMoving to the cloud brings new challenges. How can you manage a larger attack surface while ensuring great network performance? Turn to Fortinet’s Tested Reference Architectures, blueprints for designing and securing cloud environments built by cybersecurity experts. Learn more and explore use cases in this white paper.
-
10
cvsba
OpenCV wrapper for sba library
cvsba is an OpenCV wrapper for the well-known Sparse Bundle Adjustment library (sba) by M. Lourakis. The main features are: - Based on sba-1.6, one of the most popular and robust bundle adjustment implementation, which is extensively used and tested by the community - sba installation is not needed since it is included in cvsba - New CMake structure which makes the library compilation, installation and linkage easier - Similar interface than Bundle Adjustment implementation on cv::LevMarqSparse::bundleAdjust() - Include examples to test the library on synthetically generated data - GPL licence -
11
TifaMMy isn't the fastest Matrix Multiplication yet! A library for cache oblivious matrix operations using the space filling Peano curve. Aim is for BLAS / LAPACK functionality (but with an intuitive C++ API).
-
12
TextProcessor
A Java package to preprocess text datasets for posterior text analysis
The TextProcessor Java package is a text processing toolkit, which provides some frequently used text processing functions such as stemming, removing stop-words, generating a term vocabulary, and calculating the term-doc frequency matrix. Basic topic mining models such as LDA and sparse NMF are also supported. The package can also generate feature files from a given text dataset with LDA and LIBSVM format for posterior procedures such as classification or clustering. The toolkit is also being extended for more advanced text analysis tasks based on natural language processing techniques. -
13
connect3d
Reconstruct Water-Tight Triangulation from Point Cloud
This software reconstructs water-tight triangulations from point clouds, interpolating the points. It approximates the triangle mesh which minimizes the sum of all triangles' longest edge. As a result, it can interpolate much more sparse sampling as state-of-the-art algorithms. Run-time is in practice linear to that of the Delaunay triangulation of the points. The software is designed as a command-line tool. It can also be used as a library. A plug-in for the Meshlab geometry software is available as well. -
14
The Enterprise Science Processing Architecture is a modular science processing system that encourages code reuse. It is based on the Chain of Responsibility and strives to remain simple and sparse to support the widest possible community of users.
-
15
The igraph library
Library for creating and manipulating graphs
This is a library for creating and manipulating graphs with focus on speedy operations for large, sparse graphs. -
16
Seldon is a C++ library for linear algebra. It provides vectors and matrices: full, sparse, triangular, hermitian, ... It includes interfaces to Blas, Lapack, Mumps, SuperLU and UmfPack. Seldon implements several solvers such as Gmres, BiCgSTAB, Qmr,
-
17
MEPCM Package
This is a package for multi-element probabilistic collocation method.
The Multi-Element Probabilistic Collocation Method Package (MEPCMP) is a C++ package which can generate high dimensional, multi-element collocation points based on arbitrary probability density function for the application of Multi-Element Probabilistic Collocation Method (MEPCM). This package can generate high-dimensional stochastic collocation points based on tensor product rule, non-nested sparse grids method or anchored-ANOVA method. It can also be used for the multi-element probabilistic polynomial chaos method. -
18
Processor Enhanced Recursive Dynamics
Processor Enhanced Robust Core Solver for Recursive Multibody Dynamics
...Gaussian Elimination with Complete Pivoting converts constraint Jacobian matrices and equations into Row-Reduced Echelon Form and partitions variables into Dependent/Independent sets. The constrained equations of motion are effectively converted from DAE to ODE form, allowing simple robust sparse factor and solve algorithms. Processors enhance and maintain most aspects of runtime algorithm performance, insuring continuous robust and efficient solutions. ANSI-C is the proposed programming language. Project administrator and programmers are needed. I will provide theoretical background, technical detail, and training once I learn how to use this website. -
19
Pick 5
Pick 5, Washington's Lottery picker
Pick 5, Washington's Lottery picker for Automated What IF report, pairs, triplets, spread signature variant relief. Perfect ODD, Perfect Even, Perfect Spread, Perfect singles, pairs, triplets, quads. Spectrum sparse rating to perfect rating. Hit 5 game. Simulate making living on playing the Lottery. -
20
This project provides a set of Python tools for creating various kinds of neural networks, which can also be powered by genetic algorithms using grammatical evolution. MLP, backpropagation, recurrent, sparse, and skip-layer networks are supported.
-
21
SPARSE: A Symptom-based Antipattern Retrieval Knowledge-based System Using Semantic Web Technologies
-
22
yaUFget
Yet Another Python Interface to the UF sparse matrix collection
The package yaUFget is yet another interface to the collection of sparse matrices at the University of Florida for Python. In contrast with the official Python interface it can be easily used as a package and can be imported to any place, obtains the updated index of matrices from the collection's web site and does not require MATLAB. The functionality of the MATLAB's interface UFget was preserved. -
23
-
24
An implementation of the sparse FFT algorithms discovered by Mark Iwen and described in http://www.math.duke.edu/~markiwen/DukePage/Papers/JcFFTsubmit.pdf. Used for benchmarking in http://www.ima.umn.edu/preprints/jul2010/2326.pdf.
-
25
This project attempts to create a functions library specialized in the computation of a sparse Matrix-Vector product on the GPU with float and double precision and their respective complex values.
