output
20022024
most citedReducing Network Traffic in Unstructured P2P Systems Using Top-k Queries

69 citations

30 papers

cs.DC2024★ 10 cited

Using Sequential Runtime Distributions for the Parallel Speedup Prediction of SAT Local Search

Alejandro Arbelaez, Charlotte Truchet, Philippe Codognet

This paper presents a detailed analysis of the scalability and parallelization of local search algorithms for the Satisfiability problem. We propose a framework to estimate the par…

cs.CL2016★ 11 cited

Keyphrase Annotation with Graph Co-Ranking

Adrien Bougouin, Florian Boudin, Béatrice Daille

Keyphrase annotation is the task of identifying textual units that represent the main content of a document. Keyphrase annotation is either carried out by extracting the most impor…

cs.AI2016★ 2 cited

Possibilistic Networks: Parameters Learning from Imprecise Data and Evaluation strategy

Maroua Haddad, Philippe Leray, Nahla Ben Amor

There has been an ever-increasing interest in multidisciplinary research on representing and reasoning with imperfect data. Possibilistic networks present one of the powerful frame…

cs.CY2014★ 1 cited

Tools for Terminology Processing

C. Enguehard, B. Daille, E. Morin

Automatic terminology processing appeared 10 years ago when electronic corpora became widely available. Such processing may be statistically or linguistically based and produces te…

cs.CY2014

Annotating Video with Open Educational Resources in a Flipped Classroom Scenario

Olivier Aubert, Joscha Jaeger

A wealth of Open Educational Resources is now available, and beyond the first and evident problem of finding them, the issue of articulating a set of resources is arising. When usi…

cs.DB2014★ 5 cited

Fedra: Query Processing for SPARQL Federations with Divergence

Gabriela Montoya, Hala Skaf-Molli, Pascal Molli +1

Data replication and deployment of local SPARQL endpoints improve scalability and availability of public SPARQL endpoints, making the consumption of Linked Data a reality. This sol…