Search Results for "data" - Page 3
Sort By:
Showing 92 open source projects for "data"
View related business solutions-
Cut Cloud Costs with Google Compute EngineSave on compute costs with Compute Engine. Reduce your batch jobs and workload bill 60-91% with Spot VMs. Compute Engine's committed use offers customers up to 70% savings through sustained use discounts. Plus, you get one free e2-micro VM monthly and $300 credit to start.
-
Cut Data Warehouse Costs up to 54% with BigQueryBigQuery delivers up to 54% lower TCO than cloud alternatives. Migrate from legacy or competing warehouses using free BigQuery Migration Service with automated SQL translation. Get serverless scale with no infrastructure to manage, compressed storage, and flexible pricing—pay per query or commit for deeper discounts. New customers get $300 in free credit.
-
1
This projects has the intent to take any file that has a header and any number of lines, take out the blank lines, the carriage return and the line feed, given as delimitation the "project number" format and generates a new clean file.
-
2
Isolate Project is a straightforward data retrieval software that connects to popular relational database management systems and performs search operations based on the criteria specified. This project aims to speedup data retrieval operations.
-
3
Tpl makes it easy to serialize your C data using just a handful of API functions. The data is stored in its native binary form for maximum efficiency. C, Perl and XML supported. Data is portable across CPU types and OS's from Unix to Mac to Windows.
-
4
An implementation of "k-Way Merging" as described in "Fundamentals of Data Structures" by Horowitz/Sahni. NOTE: This project has been moved to http://code.google.com/p/kway/
-
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.
-
5
The goal: to provide implementations of as many algorithms (sorting, searching, ...) and data structures (lists, trees, ...) as possible, accompanied by discussion of big O run time and memory limits and references to sources of further study.
-
6
-
7
The Vodoo/Stream project let users to define transducers dedicated to document analysis. Such transducers describe how fragments are matched and transformed. Finally a document can be an XML fragment, a free text or something else depending on extensions
-
8
Open Screening Environment is a open source system for management of High Throughput Screening related experiments. The platform consists of new research tools that will enhance significantly management and analysis of HTS data. More information can be f
-
9
Red-Black Maps and Trees, written in Java. These Classes try to advoid the overhead produced by Sun's implementations. For example Trees are just Trees, nor self mapped Maps. Access on nodelevel is possible, reducing overhead while iterating over an map
-
Build AI Apps with Gemini 3 on Vertex AIVertex AI gives developers access to Gemini 3—Google’s most advanced reasoning and coding model—plus 200+ foundation models including Claude, Llama, and Gemma. Build generative AI apps with Vertex AI Studio, customize with fine-tuning, and deploy to production with enterprise-grade MLOps. New customers get $300 in free credits.
-
10
Ky eshte nje projekt i HAPUR/FALAS per publikun Shqip-foles i cili permban nje seri Video-Kursesh, Udhezime, dhe Shembuj Kodi per gjuhe (web) si: XHTML, CSS, JS, PHP, AS3 etj. si dhe per Desktop: C++, Java, Adobe Air etj. + programe/praktika te ndryshme.
-
11
An easy to extend, highly graphical, easy to use 2D robot simulator specialized for path planning algorithms. Can be used in testing various robotic algorithms, and already used for comparison of path planning algorithms like RRT, RRTConnect, PRM, RboT..
-
12
Genetic Programming (tree structure) predictor within Weka data mining software for both continuous and classification problems.
-
13
OptorSim is a Grid simulator designed to test dynamic replication strategies used in optimising data location within a Grid. Each simulated site contains several storage or computing elements. Simulated jobs run and file accesses may trigger replication.
-
14
jCrosstab is an API to convert JDBC ResultSet objects to a set of arrays that translate the data from Tabular (or MultiTabular) to CrossTab or Multi-Crosstab. The idea is similar to an Excel Pivot Table, but more powerful.
-
15
Openminer, as a data mining engine, is developed on java for analysis of dataset with the methods of data mining. By making use of openminer, we could discovery the knowledge which interests us but hides in the raw data.
-
16
An academic project where computer-science students can practice data structures principles. Based on the famous problem of the labyrinth rat, this application has an engine where you can run your own algorithms to help the robot to get out of the laby.
-
17
Locality Sensitive Hashing is an improved indexing method for high dimensional data. lshtools provides indexing with LSH and an intelligent non supervised subsampling strategy using this indexing method.
-
18
An attempt to design minimum cost broadband networks with the use of a modified version of the Particle Swarm Optimization method. A GIS subsystem is used for the visualization of data and results.
-
19
Plantra-Trajectory Planning is a software to rebuild surfaces from cloud points, featuring shaded 3D visualization and path planning for robotics paths. It uses Voronoi diagram, Cyrus-Beck clipping, Delaunay triangulation and B-Splines.
-
20
-
21
LiMa means Lightweight Markup Language. It is a parser for an easy to use ASCII/Text-based markup - comparable to Markdown or the Wikipedia-Markup language with special configurable extensions in defining Links and image-resources.
-
22
K-automaton is a new parsing (syntactic analysis) machine isomorphous to language. Implemented in Java. Can generate Java code from grammars described in EBNF.
-
23
KNN-WEKA provides a implementation of the K-nearest neighbour algorithm for Weka. Weka is a collection of machine learning algorithms for data mining tasks. For more information on Weka, see http://www.cs.waikato.ac.nz/ml/weka/.
-
24
This application talks to a GPS device over the NMEA protocol via the WIGSGPSComm API. The first version of the WIGS application will present the GPS data in an intuitive fashion, and later releases will be further enhanced with special map support.
-
25
basE91 is an advanced method for encoding binary data as ASCII characters. It is similar to UUencode or base64, but is more efficient. The overhead produced by basE91 depends on the input data. It amounts at most to 23% and can range down to 14%.
