6 citations · 8 across the 4 of their papers we have counts for
4 papers
Misspelling Oblivious Word Embeddings
Bora Edizel, Aleksandra Piktus, Piotr Bojanowski +3
In this paper we present a method to learn word embeddings that are resilient to misspellings. Existing word embeddings have limited applicability to malformed texts, which contain…
Amortized -Delay Algorithm for Listing Chordless Cycles in Undirected Graphs
Rui Ferreira, Roberto Grossi, Romeo Rizzi +2
Chordless cycles are very natural structures in undirected graphs, with an important history and distinguished role in graph theory. Motivated also by previous work on the classica…
Efficiently Listing Combinatorial Patterns in Graphs
Rui Ferreira
Graphs are extremely versatile and ubiquitous mathematical structures with potential to model a wide range of domains. For this reason, graph problems have been of interest since t…
Optimal Listing of Cycles and st-Paths in Undirected Graphs
Rui Ferreira, Roberto Grossi, Andrea Marino +3
We present the first optimal algorithm for the classical problem of listing all the cycles in an undirected graph. We exploit their properties so that the total cost is the time ta…