Nachiket Kapre

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 Gopalakrishna Hegde

> Home > Persons > Nachiket Kapre

Publications

2018
[j10]
- view
  authority control:
- export record
  dblp key:
  - journals/tecs/HegdeSK18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tecs/HegdeSK18
Gopalakrishna Hegde, Siddhartha, Nachiket Kapre:
CaffePresso: Accelerating Convolutional Networks on Embedded SoCs. ACM Trans. Embed. Comput. Syst. 17(1): 15:1-15:26 (2018)
2016
[c53]
- view
  authority control:
- export record
  dblp key:
  - conf/cases/HegdeSRK16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cases/HegdeSRK16
Gopalakrishna Hegde, Siddhartha, Nachiappan Ramasamy, Nachiket Kapre:
CaffePresso: an optimized library for deep learning on embedded accelerator-based platforms. CASES 2016: 14:1-14:10
[c51]
- view
  authority control:
- export record
  dblp key:
  - conf/fccm/HegdeSRBK16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fccm/HegdeSRBK16
Gopalakrishna Hegde, Siddhartha, Nachiappan Ramasamy, Vamsi Buddha, Nachiket Kapre:
Evaluating Embedded FPGA Accelerators for Deep Learning Applications. FCCM 2016: 25
2015
[c33]
- view
  authority control:
- export record
  dblp key:
  - conf/fccm/HegdeK15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fccm/HegdeK15
Gopalakrishna Hegde, Nachiket Kapre:
Energy-Efficient Acceleration of OpenCV Saliency Computation Using Soft Vector Processors. FCCM 2015: 76-83

a service of

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.