Abstract: We consider the approximate pattern matching problem under the edit distance. Given a text T of length n, a pattern P of length m, and a threshold k, the task is to find the starting ...
This repository contains code for our SPAA paper "Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable" (SPAA'18). It includes implementations of the following parallel graph ...
String theory captured the hearts and minds of many physicists decades ago because of a beautiful simplicity. Zoom in far enough on a patch of space, the theory says, and you won’t see a menagerie of ...
Centre for Quantum Engineering, Research and Education (CQuERE), TCG Centres for Research and Education in Science and Technology (TCG CREST), Sector V, Salt Lake, Kolkata700091, India ...
The Easy Communications (EasyCom) dataset is a world-first dataset designed to help mitigate the cocktail party effect from an augmented-reality (AR) -motivated multi-sensor egocentric world view. The ...
The amounts of data processed by applications are constantly growing. With this growth, scaling storage becomes more challenging. Every database system has its own trade-offs. Understanding them is ...
Evolutionary optimization (EO) is a technique for finding approximate solutions to difficult or impossible numeric optimization problems. In particular, EO can be used to train a neural network. EO is ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results