Essays about: "range queries"
Showing result 1 - 5 of 22 essays containing the words range queries.
-
1. Integration of GraphQL data sources into an RDF federation engine
University essay from Linköpings universitet/Institutionen för datavetenskapAbstract : As data interoperability has become increasingly more important as of late, so has the topic of database query language translations. Being able to translate between different query languages, both old and new, could potentially improve a lot of different systems. READ MORE
-
2. Users’ Attitude Towards ChatGPT : A sentiment Analysis on Twitter & Reddit
University essay from Uppsala universitet/InformationssystemAbstract : OpenAI recently introduced ChatGPT, a chatbot powered by the GPT-3 family of deep learninglanguage models (LLMs). With the aid of machine learning techniques, ChatGPT has been fine-tuned to improve its capacity to respond to a diverse range of queries, and it has been describedas one of the most advanced machine learning technologies currently available. READ MORE
-
3. Evaluating performance of homomorphic encryption applied on delta encoding
University essay from Linköpings universitet/Databas och informationsteknikAbstract : Homomorphic encryption is an encryption scheme that allows for simple operations on encrypted data. These operations are mainly boolean circuits combined into more complexarithmetic operations, rotations, and others. Homomorphic encryption was first implemented in 2009, and in the following decade, many different versions emerged. READ MORE
-
4. Flight search engine CPU consumption prediction
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : The flight search engine is a technology used in the air travel industry. It allows the traveler to search and book for the best flight options, such as the combination of flights while keeping the best services, options, and price. The computation for a flight search query can be very intensive given its parameters and complexity. READ MORE
-
5. Parallel Minimum Cuts : An improved CREW PRAM algorithm
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : This thesis considers the minimum cut problem in undirected, weighted graphs. We present a simple randomized CREW PRAM algorithm to find the minimum cut in a graph G with n nodes and m edges, based on Karger’s celebrated randomized near-linear time min-cut algorithm [STOC’96]. READ MORE