Publications related to Full-text search

Further Collapses in TFNP

Mika Tapani Göös, Gilbert Théodore Maystre, Alexandros Paul Hollender, Siddhartha Jain, Ran Tao

We show EOPL = PLS ∩ PPAD. Here the class EOPL consists of all total search problems that reduce to the End-of-Potential-Line problem, which was introduced in the works by Hubáček and Yogev (SICOMP 2020) and Fearnley et al. (JCSS 2020). In particular, our ...

Schloss Dagstuhl - Leibniz-Zentrum für Informatik2022

Knowledge-Aware Cross-Modal Text-Image Retrieval for Remote Sensing Images

Devis Tuia, Christel Marie Tartini-Chappuis, Li Mi, Siran Li

Image-based retrieval in large Earth observation archives is difficult, because one needs to navigate across thousands of candidate matches only with the proposition image as a guide. By using text as a query language, the retrieval system gains in usabili ...

2022

Graph Embedding for Retrieval

Chi Thang Duong

Information retrieval (IR) systems such as search engines are important for people to find what they need among the tremendous amount of data available in their organization or on the Internet. These IR systems enable users to search in a large data collec ...

EPFL2022

On Calculating the Minimum Rate for the Cooperative Data Exchange Problem Over Fully Connected Networks

Michael Christoph Gastpar, Su Li

We study the cooperative data exchange problem for fully connected networks. In this problem, nodes make broadcast transmissions to recover a file consisting of K independent packets. Each node initially only possesses a subset of the packets. We propose ( ...

2021

Pyramid Architecture Search for Real-Time Image Deblurring

Wei Liu, Kaicheng Yu

Multi-scale and multi-patch deep models have been shown effective in removing blurs of dynamic scenes. However, these methods still suffer from one major obstacle: manually designing a lightweight and high-efficiency network is challenging and time-consumi ...

IEEE2021

Language Resources for Historical Newspapers: the Impresso Collection

Maud Ehrmann, Matteo Romanello, Raphaël Barman

Following decades of massive digitization, an unprecedented amount of historical document facsimiles can now be retrieved and accessed via cultural heritage online portals. If this represents a huge step forward in terms of preservation and accessibility, ...

European Language Resources Association2020

Multi-scale sequential network for semantic text segmentation and localization

Jean-Marc Odobez, Olivier Canévet, Michael Villamizar

We present a novel method for semantic text document analysis which in addition to localizing text it labels the text in user-defined semantic categories. More precisely, it consists of a fully-convolutional and sequential network that we apply to the part ...

2020

Practical Private Range Search in Depth

Odysseas Papapetrou, Ioannis Demertzis

We consider a data owner that outsources its dataset to an untrusted server. The owner wishes to enable the server to answer range queries on a single attribute, without compromising the privacy of the data and the queries. There are several schemes on “pr ...

2018

Quantifying Collaboration in Synchronous Document Editing

Adrian Pierre Sergio Pace, Jennifer Kaitlyn Olsen, Louis Antoine Baligand, Stian Haklev

Collaborative synchronous writing tools like Google Docs and Etherpad let multiple users edit the same document and see each others edits in near real-time to simplify collaboration and avoid merge-conflicts. These tools are used extensively across many do ...

2018

Environmental Monitoring using Autonomous Vehicles: A Survey of Recent Searching Techniques

Auke Ijspeert, Alessandro Crespi

Autonomous vehicles are becoming an essential tool in a wide range of environmental applications that include ambient data acquisition, remote sensing, and mapping of the spatial extent of pollutant spills. Among these applications, pollution source locali ...

Elsevier2017

Distribution-Matching Embedding for Visual Domain Adaptation

Mathieu Salzmann

Domain-invariant representations are key to addressing the domain shift problem where the training and test examples follow different distributions. Existing techniques that have attempted to match the distributions of the source and target domains typical ...

2016

Practical Private Range Search Revisited

Odysseas Papapetrou, Ioannis Demertzis

We consider a data owner that outsources its dataset to an untrusted server. The owner wishes to enable the server to answer range queries on a single attribute, without compromising the privacy of the data and the queries. There are several schemes on "pr ...

2016

Word Embeddings for Natural Language Processing

Rémi Philippe Lebret

Word embedding is a feature learning technique which aims at mapping words from a vocabulary into vectors of real numbers in a low-dimensional space. By leveraging large corpora of unlabeled text, such continuous space representations can be computed for c ...

EPFL2016

5e{x+y}: Searching over Mathematical Content in Digital Libraries

Karl Aberer

This paper presents 5ex+y, a system that is able to extract, index and query mathematical content expressed as mathematical expressions, complementing the CERN Document Server (CDS). We present the most important aspects of its design, our approach to mode ...

ACM2015

Rapid optimisation of a lactate biosensor design using soft probes scanning electrochemical microscopy

Hubert Girault, Andreas Stephan Lesch, Fernando Cortes Salazar

We report the mapping of biocatalytically active surfaces, particularly on an express search for optimal immobilization conditions of the enzyme lactate oxidase by means of scanning electrochemical microscopy (SECM). With this aim, soft stylus SECM probes ...

Elsevier2014

Simplified models for LHC new physics searches

Roberto Franceschini, Tao Liu, Jing Shu, Tao Han, Yue Zhao, Yang Bai

This document proposes a collection of simplified models relevant to the design of new-physics searches at the Large Hadron Collider (LHC) and the characterization of their results. Both ATLAS and CMS have already presented some results in terms of simplif ...

Iop Publishing Ltd2012

Query-Driven Indexing for Scalable Peer-to-Peer Text Retrieval

Karl Aberer, Martin Rajman, Gleb Skobeltsyn, Vinh Toan Luu, Ivana Podnar

In this paper, we present a query-driven indexing/retrieval strategy for efficient full text retrieval from large document collections distributed within a structured P2P network. Our indexing strategy is based on two important properties: (1) the generate ...

2009

Query-Driven Indexing for Scalable Peer-to-Peer Text Retrieval

Karl Aberer, Martin Rajman, Gleb Skobeltsyn, Vinh Toan Luu, Ivana Podnar

We present a query-driven algorithm for the distributed indexing of large document collections within structured P2P networks. To cope with bandwidth consumption that has been identified as the major problem for the standard P2P approach with single term i ...

2009

Answering questions about archived, annotated meetings

Marita Ailomaa

Retrieving information from archived meetings is a new domain of information retrieval that has received increasing attention in the past few years. Search in spontaneous spoken conversations has been recognized as more difficult than text-based document r ...

EPFL2009

Query-driven indexing in large-scale distributed systems

Gleb Skobeltsyn

Efficient and effective search in large-scale data repositories requires complex indexing solutions deployed on a large number of servers. Web search engines such as Google and Yahoo! already rely upon complex systems to be able to return relevant query re ...

EPFL2009