Concept

String-searching algorithm

Related publications (30)

List Ordered Statistics Decoders for Polar Codes

Andreas Peter Burg, Yifei Shen, Chuan Zhang

The de-facto standard decoding algorithm for polar codes, successive cancellation list (SCL) decoding, is a breadth-first search algorithm. By keeping a list of candidate codewords, SCL decoding improves the performance as the list size L increases. Howeve ...

IEEE2022

An Analysis of Super-Net Heuristics in Weight-Sharing NAS

Mathieu Salzmann, Kaicheng Yu

Weight sharing promises to make neural architecture search (NAS) tractable even on commodity hardware. Existing methods in this space rely on a diverse set of heuristics to design and train the shared-weight backbone network, a.k.a. the super-net. Since he ...

IEEE COMPUTER SOC2022

Matchertext: Towards Verbatim Interlanguage Embedding

Bryan Alexander Ford

Embedding text in one language within text of another is commonplace for numerous purposes, but usually requires tedious and error-prone “escaping” transformations on the embedded string. We propose a simple cross-language syntactic discipline, matchertext ...

2022

Fractal-like Mechanical Resonators with a Soft-Clamped Fundamental Mode

Tobias Kippenberg, Alberto Beccari, Nils Johan Engelsen, Sergey Fedorov

Self-similar structures occur naturally and have been employed to engineer exotic physical properties. We show that acoustic modes of a fractal-like system of tensioned strings can display increased mechanical quality factors due to the enhancement of diss ...

AMER PHYSICAL SOC2020

String Matching: Communication, Circuits, and Learning

Mika Tapani Göös

String matching is the problem of deciding whether a given n-bit string contains a given k-bit pattern. We study the complexity of this problem in three settings. - Communication complexity. For small k, we provide near-optimal upper and lower bounds on th ...

Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany2019

An Optimal Planning Framework to Deploy Self-Reconfigurable Modular Robots

Auke Ijspeert, Mehmet Hasan Mutlu, Simon Lukas Hauser, Hala Khodr, Alexandre Bernardino

Self-reconfiguration is a hard problem due to the high dimensionality of self-reconfigurable modular systems. Searchbased approaches offer complete and optimal solutions. However, naive search algorithms cannot directly solve self-reconfiguration tasks in ...

2019

Matching Features without Descriptors:Implicitly Matched Interest Points

Davide Scaramuzza, Titus Cieslewski

The extraction and matching of interest points is a prerequisite for many geomet-ric computer vision problems. Traditionally, matching has been achieved by assigningdescriptors to interest points and matching points that have similar descriptors. In this p ...

2019

Storage Efficient Substring Searchable Symmetric Encryption

Iraklis Leontiadis, Ming Li

We address the problem of substring searchable encryption. A single user produces a big stream of data and later on wants to learn the positions in the string that some patterns occur. Although current techniques exploit auxiliary data structures to achiev ...

ASSOC COMPUTING MACHINERY2018

Storage Efficient Substring Searchable Symmetric Encryption

Iraklis Leontiadis, Ming Li

2018

Jumping the ORDER BY Barrier in Large-Scale Pattern Matching

Daniel Lupei

Event-series pattern matching is a major component of large-scale data analytics pipelines enabling a wide range of system diagnostics tasks. A precursor to pattern matching is an expensive ``shuffle the world'' stage wherein data are ordered by time and s ...

2017

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.