Sourav Dutta 0001

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Edward Burgin

> Home > Persons > Sourav Dutta 0001

Publications

2022
[c30]
- view
  authority control:
- export record
  dblp key:
  - conf/pkdd/BurginDAP22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/pkdd/BurginDAP22
Edward Burgin, Sourav Dutta, Haytham Assem, Raj Nath Patel:
Cage: A Hybrid Framework for Closed-Domain Conversational Agents. ECML/PKDD (6) 2022: 636-640
2021
[c27]
- view
  authority control:
- export record
  dblp key:
  - conf/bigdataconf/PatelBAD21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/bigdataconf/PatelBAD21
Raj Nath Patel, Edward Burgin, Haytham Assem, Sourav Dutta:
Efficient Multi-Lingual Sentence Classification Framework with Sentence Meta Encoders. IEEE BigData 2021: 1889-1899
[c23]
- view
  authority control:
- export record
  dblp key:
  - conf/sigdial/AssemDB21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sigdial/AssemDB21
Haytham Assem, Sourav Dutta, Edward Burgin:
DTAFA: Decoupled Training Architecture for Efficient FAQ Retrieval. SIGDIAL 2021: 423-430
[i16]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2108-10019
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2108-10019
Sourav Dutta, Haytham Assem, Edward Burgin:
Sequence-to-Sequence Learning on Keywords for Efficient FAQ Retrieval. CoRR abs/2108.10019 (2021)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.