7 citations · 7 across the 9 of their papers we have counts for
9 papers
SPUQ: Perturbation-Based Uncertainty Quantification for Large Language Models
Xiang Gao, Jiaxin Zhang, Lalla Mouatadid +1
In recent years, large language models (LLMs) have become increasingly prevalent, offering remarkable text generation capabilities. However, a pressing challenge is their tendency…
DECDM: Document Enhancement using Cycle-Consistent Diffusion Models
Jiaxin Zhang, Joy Rimchala, Lalla Mouatadid +2
The performance of optical character recognition (OCR) heavily relies on document image quality, which is crucial for automatic document processing and document intelligence. Howev…
RE: Region-Aware Relation Extraction from Visually Rich Documents
Pritika Ramu, Sijia Wang, Lalla Mouatadid +2
Current research in form understanding predominantly relies on large pre-trained language models, necessitating extensive data for pre-training. However, the importance of layout s…
A Scalable Technique for Weak-Supervised Learning with Domain Constraints
Sudhir Agarwal, Anu Sreepathy, Lalla Mouatadid
We propose a novel scalable end-to-end pipeline that uses symbolic domain knowledge as constraints for learning a neural network for classifying unlabeled data in a weak-supervised…
(α, β)-Modules in Graphs
Michel Habib, Lalla Mouatadid, Eric Sopena +1
Modular Decomposition focuses on repeatedly identifying a module M (a collection of vertices that shares exactly the same neighbourhood outside of M) and collapsing it into a singl…
Maximum Induced Matching Algorithms via Vertex Ordering Characterizations
Michel Habib, Lalla Mouatadid
We study the maximum induced matching problem on a graph g. Induced matchings correspond to independent sets in L2(g), the square of the line graph of g. The problem is NP-complete…
A New Graph Parameter To Measure Linearity
Pierre Charbit, Michel Habib, Lalla Mouatadid +1
Consider a sequence of LexBFS vertex orderings σ1, σ2, . . . where each ordering σi is used to break ties for σi+1. Since the total number of vertex orderings of a finite graph is…
Path Graphs, Clique Trees, and Flowers
Lalla Mouatadid, Robert Robere
An \emph{asteroidal triple} is a set of three independent vertices in a graph such that any two vertices in the set are connected by a path which avoids the neighbourhood of the th…
Linear Time LexDFS on Cocomparability Graphs
Ekkehard Köhler, Lalla Mouatadid
Lexicographic depth first search (LexDFS) is a graph search protocol which has already proved to be a powerful tool on cocomparability graphs. Cocomparability graphs have been well…