Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Travis S. Humble

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 Kathleen E. Hamilton

> Home > Persons > Travis S. Humble

Publications

2024
[i29]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2401-12485
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2401-12485
Prasanna Date, Dong Jun Woun, Kathleen E. Hamilton, Eduardo Antonio Coello Pérez, Mayanka Chandra Shekar, Francisco Rios, John Gounley, In-Saeng Suh, Travis S. Humble, Georgia D. Tourassi:
Adiabatic Quantum Support Vector Machines. CoRR abs/2401.12485 (2024)
2020
[j15]
- view
  authority control:
- export record
  dblp key:
  - journals/topc/HamiltonSYBIH20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/topc/HamiltonSYBIH20
Kathleen E. Hamilton, Catherine D. Schuman, Steven R. Young, Ryan S. Bennink, Neena Imam, Travis S. Humble:
Accelerating Scientific Computing in the Post-Moore's Era. ACM Trans. Parallel Comput. 7(1): 6:1-6:31 (2020)
2018
[j10]
- view
  authority control:
- export record
  dblp key:
  - journals/jetc/HamiltonIH18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jetc/HamiltonIH18
Kathleen E. Hamilton, Neena Imam, Travis S. Humble:
Sparse Hardware Embedding of Spiking Neuron Systems for Community Detection. ACM J. Emerg. Technol. Comput. Syst. 14(4): 40:1-40:13 (2018)
[c12]
- view
  authority control:
- export record
  dblp key:
  - conf/ipps/HamiltonSYIH18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ipps/HamiltonSYIH18
Kathleen E. Hamilton, Catherine D. Schuman, Steven R. Young, Neena Imam, Travis S. Humble:
Neural Networks and Graph Algorithms with Next-Generation Processors. IPDPS Workshops 2018: 1194-1203
2017
[j6]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/entropy/SchrockMHHI17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/entropy/SchrockMHHI17
Jonathan Schrock, Alexander J. McCaskey, Kathleen E. Hamilton, Travis S. Humble, Neena Imam:
Recall Performance for Content-Addressable Memory Using Adiabatic Quantum Optimization. Entropy 19(9): 500 (2017)
[j4]
- view
  authority control:
- export record
  dblp key:
  - journals/qip/HamiltonH17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/qip/HamiltonH17
Kathleen E. Hamilton, Travis S. Humble:
Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets. Quantum Inf. Process. 16(4): 94 (2017)
[c7]
- view
  authority control:
- export record
  dblp key:
  - conf/ncs2/HamiltonIH17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ncs2/HamiltonIH17
Kathleen E. Hamilton, Neena Imam, Travis S. Humble:
Community detection with spiking neural networks for neuromorphic hardware. NCS 2017: 9:1-9:8
[i8]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1711-07361
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1711-07361
Kathleen E. Hamilton, Neena Imam, Travis S. Humble:
Community detection with spiking neural networks for neuromorphic hardware. CoRR abs/1711.07361 (2017)

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.