Related publications (8)

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

A Decision Procedure for Regular Membership and Length Constraints over Unbounded Strings

Andrew Joseph Reynolds

We prove that the quantifier-free fragment of the theory of character strings with regular language membership constraints and linear integer constraints over string lengths is decidable. We do that by describing a sound, complete and terminating tableaux ...
Springer-Verlag Berlin2015

What is the color of chocolate? - extracting color values of semantic expressions

Sabine Süsstrunk, Albrecht Johannes Lindner

We present a statistical framework to automatically determine an associated color for a given arbitrary semantic expression. The expression can not only be a color name but any word or character string. In addition to the color value, we are also able to c ...
2012

A Non-interactive Range Proof with Constant Communication

Rafik Chaabouni, Helger Lipmaa

In a range proof, the prover convinces the verifier in zero-knowledge that he has encrypted or committed to a value a ∈ [0,H] where H is a public constant. Most of the previous non-interactive range proofs have been proven secure in the random oracle model ...
Springer Berlin Heidelberg2012

Inversion-induced disruption of the Hoxd cluster leads to the partition of regulatory landscapes

Denis Duboule

The developmental regulation of vertebrate Hox gene transcription relies on the interplay between local and long-range controls. To study this complex genomic organization, we designed a strategy combining meiotic and targeted recombinations to induce larg ...
2005

Text detection and recognition in images and video sequences

Datong Chen

Text characters embedded in images and video sequences represents a rich source of information for content-based indexing and retrieval applications. However, these text characters are difficult to be detected and recognized due to their various sizes, gra ...
2003

Text detection and recognition in images and video sequences

Datong Chen

Text characters embedded in images and video sequences represents a rich source of information for content-based indexing and retrieval applications. However, these text characters are difficult to be detected and recognized due to their various sizes, gra ...
École Polytechnique Fédérale de Lausanne2003

Text detection and recognition in images and video sequences

Datong Chen

Text characters embedded in images and video sequences represents a rich source of information for content-based indexing and retrieval applications. However, these text characters are difficult to be detected and recognized due to their various sizes, gra ...
EPFL2003

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.