default search action
Andrew Hunt
This is just a disambiguation page, and is not intended to be the bibliography of an actual person. The links to all actual bibliographies of persons of the same or a similar name can be found below. Any publication listed on this page has not been assigned to an actual author yet. If you know the true author of one of the publications listed below, you are welcome to contact us.
Person information
Other persons with the same name
- Andy Hunt 0001 (aka: Andrew Hunt 0001) — Coventry University, Faculty of Engineering and Computing, UK (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
- [j5]Mark D. Guido, Jared Ondricek, Justin Grover, David Wilburn, Thanh Nguyen, Andrew Hunt:
Automated identification of installed malicious Android applications. Digit. Investig. 10(Supplement): S96-S104 (2013) - 2012
- [i1]Benjamin P. Smith, Arash Farhood, Andrew Hunt, Frank R. Kschischang, John H. Lodge:
Staircase Codes: FEC for 100 Gb/s OTN. CoRR abs/1201.4106 (2012)
2000 – 2009
- 2007
- [j4]Stewart Crozier, Paul Guinand, Andrew Hunt:
Estimating the minimum distance of large-block turbo codes using iterative multiple-impulse methods. Eur. Trans. Telecommun. 18(5): 437-444 (2007) - [j3]Daniel A. Griffith, Marco Millones, Matthew Vincent, David L. Johnson, Andrew Hunt:
Impacts of Positional Error on Spatial Regression Analysis: A Case Study of Address Locations in Syracuse, New York. Trans. GIS 11(5): 655-679 (2007) - 2006
- [c6]Marie desJardins, Blazej Bulka, Ryan Carr, Andrew Hunt, Priyang Rathod, Penny Rheingans:
Heuristic Search and Information Visualization Methods for School Redistricting. AAAI 2006: 1774-1781 - 2005
- [b1]David Thomas, Chad Fowler, Andrew Hunt:
Programming Ruby - the pragmatic programmer's guide (2. ed.). O'Reilly 2005, ISBN 978-0-9745140-5-5, pp. I-XXXII, 1-830 - [j2]Stewart Crozier, Paul Guinand, Andrew Hunt:
Estimating the minimum distance of turbo-codes using double and triple impulse methods. IEEE Commun. Lett. 9(7): 631-633 (2005) - [c5]James Coplien, Brian Foote, Richard P. Gabriel, Dave A. Thomas, Cristina Videira Lopes, Brian Marick, Bonnie A. Nardi, Rob Tow, Andrew Hunt, Glenn Vanderburg:
Breakthrough ideas. OOPSLA Companion 2005: 76-86 - 2001
- [c4]Mark R. Walker, Jim Larson, Andrew Hunt:
A new W3C markup standard for text-to-speech synthesis. ICASSP 2001: 965-968
1990 – 1999
- 1994
- [c3]Andrew Hunt:
A generalised model for utilising prosodic information in continuous speech recognition. ICASSP (2) 1994: 169-172 - [c2]Andrew Hunt:
A prosodic recognition module based on linear discriminant analysis. ICSLP 1994: 1119-1122 - 1993
- [j1]Andrew Hunt:
Recurrent neural networks for syllabification. Speech Commun. 13(3-4): 323-332 (1993) - [c1]Andrew Hunt:
Utilising prosody to perform syntactic disambiguation. EUROSPEECH 1993: 1339-1342
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 23:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint