default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid Emms
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j10]Adrian M. Altenhoff
, Javier Garrayo-Ventas, Salvatore Cosentino, David Emms, Natasha M. Glover, Ana Hernández-Plaza, Yannis Nevers, Vicky Sundesha, Damian Szklarczyk, José María Fernández, Laia Codó, The Quest for Orthologs Consortium, Josep Lluis Gelpí, Jaime Huerta-Cepas, Wataru Iwasaki, Steven Kelly, Odile Lecompte, Matthieu Muffato, Maria Jesus Martin, Salvador Capella-Gutiérrez, Paul D. Thomas, Erik L. L. Sonnhammer, Christophe Dessimoz:
The Quest for Orthologs benchmark service and consensus calls in 2020. Nucleic Acids Res. 48(Webserver-Issue): W538-W545 (2020)
2010 – 2019
- 2018
- [j9]Bartosz Ziólko, David Emms, Mariusz Ziólko:
Fuzzy Evaluations of Image Segmentations. IEEE Trans. Fuzzy Syst. 26(4): 1789-1799 (2018) - 2015
- [j8]David Emms, Simone Severini, Richard C. Wilson, Edwin R. Hancock:
Corrigendum to "Coined quantum walks lift the cospectrality of graphs and trees" [Pattern Recognition 42 (9) (2009) 1988-2002]. Pattern Recognit. 48(4): 1574-1575 (2015) - 2011
- [j7]Peng Ren, Tatjana M. Aleksic, David Emms, Richard C. Wilson, Edwin R. Hancock:
Quantum walks, Ihara zeta functions and cospectrality in regular graphs. Quantum Inf. Process. 10(3): 405-417 (2011)
2000 – 2009
- 2009
- [j6]David Emms, Richard C. Wilson, Edwin R. Hancock:
Graph matching using the interference of discrete-time quantum walks. Image Vis. Comput. 27(7): 934-949 (2009) - [j5]David Emms, Richard C. Wilson, Edwin R. Hancock:
Graph matching using the interference of continuous-time quantum walks. Pattern Recognit. 42(5): 985-1002 (2009) - [j4]David Emms, Simone Severini, Richard C. Wilson, Edwin R. Hancock:
Coined quantum walks lift the cospectrality of graphs and trees. Pattern Recognit. 42(9): 1988-2002 (2009) - [j3]David Emms, Richard C. Wilson, Edwin R. Hancock:
Erratum to: Graph matching using the interference of continuous-time quantum walks [Pattern Recognition 42 (5) 985-1002]. Pattern Recognit. 42(9): 2218 (2009) - [j2]David Emms, Richard C. Wilson, Edwin R. Hancock:
Graph embedding using a quasi-quantum analogue of the hitting times of continuous time quantum walks. Quantum Inf. Comput. 9(3&4): 231-254 (2009) - 2008
- [c8]David Emms, Edwin R. Hancock, Richard C. Wilson:
Graph drawing using quantum commute time. ICPR 2008: 1-4 - [c7]David Emms, Richard C. Wilson, Edwin R. Hancock:
Graph Edit Distance without Correspondence from Continuous-Time Quantum Walks. SSPR/SPR 2008: 5-14 - 2007
- [c6]David Emms, Edwin R. Hancock, Richard C. Wilson:
Graph Similarity Using Interfering Quantum Walks. CAIP 2007: 823-831 - [c5]David Emms, Edwin R. Hancock, Richard C. Wilson:
A Correspondence Measure for Graph Matching Using the Discrete Quantum Walk. GbRPR 2007: 81-91 - [c4]David Emms, Richard C. Wilson, Edwin R. Hancock:
Graph Embedding Using Quantum Commute Times. GbRPR 2007: 371-382 - 2006
- [j1]David Emms, Edwin R. Hancock, Simone Severini, Richard C. Wilson:
A Matrix Representation of Graphs and its Spectrum as a Graph Invariant. Electron. J. Comb. 13(1) (2006) - [c3]David Emms, Edwin R. Hancock, Richard C. Wilson:
Graph Matching using Interference of Coined Quantum Walks. ICPR (3) 2006: 133-136 - 2005
- [c2]David Emms, Simone Severini, Richard C. Wilson, Edwin R. Hancock:
Coined Quantum Walks Lift the Cospectrality of Graphs and Trees. EMMCVPR 2005: 332-345 - [c1]David Emms, Simone Severini, Richard C. Wilson, Edwin R. Hancock:
Towards Unitary Representations for Graph Matching. GbRPR 2005: 153-161
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
