Pulak Purkait

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 Anders P. Eriksson

> Home > Persons > Pulak Purkait

Publications

2018
[i5]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1803-08602
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1803-08602
Pulak Purkait, Christopher Zach, Anders P. Eriksson:
Maximum Consensus Parameter Estimation by Reweighted ℓ₁ Methods. CoRR abs/1803.08602 (2018)
2017
[j5]
- view
  authority control:
- export record
  dblp key:
  - journals/pami/ChinPES17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/pami/ChinPES17
Tat-Jun Chin, Pulak Purkait, Anders P. Eriksson, David Suter:
Efficient Globally Optimal Consensus Maximisation with Tree Search. IEEE Trans. Pattern Anal. Mach. Intell. 39(4): 758-772 (2017)
[c16]
- view
  authority control:
- export record
  dblp key:
  - conf/emmcvpr/PurkaitZE17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/emmcvpr/PurkaitZE17
Pulak Purkait, Christopher Zach, Anders P. Eriksson:
Maximum Consensus Parameter Estimation by Reweighted \ell _1 ℓ 1 Methods. EMMCVPR 2017: 312-327
2015
[c13]
- view
  authority control:
- export record
  dblp key:
  - conf/cvpr/ChinPES15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cvpr/ChinPES15
Tat-Jun Chin, Pulak Purkait, Anders P. Eriksson, David Suter:
Efficient globally optimal consensus maximisation with tree search. CVPR 2015: 2413-2421

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.