Researcher profile
Laks V. S. Lakshmanan
3 papers in the PaperMetrix corpus
Publications
Papers by this author
-
Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs
2020
Given a directed graph G, the directed densest subgraph (DDS) problem refers to the finding of a subgraph from G, whose density is the highest among all the subgraphs of G. The DDS problem is …
-
A Benchmark Study of Contrastive Learning for Arabic Social Meaning
2022 · arXiv (Cornell University)
Contrastive learning (CL) brought significant progress to various NLP tasks. Despite this progress, CL has not been applied to Arabic NLP to date. Nor is it clear how much benefits it could bring to particular …
-
SANS: Efficient Densest Subgraph Discovery over Relational Graphs without Materialization
2025
How can we efficiently identify the densest subgraph over relational graphs? Existing dense subgraph discovery (DSD) approaches assume that a relational graph H is already derived from a heterogeneous data source and they focus on …