default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrew Arnold
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[c14]Andrew Arnold, Paul Corapi, Michael Nasta, Kevin Wolgast, Thomas A. Babbitt:
A raspberry Pi sensor network for wildlife conservation. HotSoS 2020: 15:1-15:3- [i7]Cheng Tang, Andrew Arnold:
Neural document expansion for ad-hoc information retrieval. CoRR abs/2012.14005 (2020)
2010 – 2019
- 2018
- [j9]John McCamley
, William Denton, Andrew Arnold, Peter C. Raffalt, Jennifer M. Yentes:
On the Calculation of Sample Entropy Using Continuous and Discrete Human Gait Data. Entropy 20(10): 764 (2018) - 2016
- [j8]Andrew Arnold, Mark Giesbrecht, Daniel S. Roche:
Faster sparse multivariate polynomial interpolation of straight-line programs. J. Symb. Comput. 75: 4-24 (2016) - 2015
- [c13]Andrew Arnold, Erich L. Kaltofen:
Error-Correcting Sparse Interpolation in the Chebyshev Basis. ISSAC 2015: 21-28 - [c12]Andrew Arnold, Daniel S. Roche:
Output-Sensitive Algorithms for Sumset and Sparse Polynomial Multiplication. ISSAC 2015: 29-36 - [i6]Andrew Arnold, Daniel S. Roche:
Output-sensitive algorithms for sumset and sparse polynomial multiplication. CoRR abs/1501.05296 (2015) - 2014
- [j7]Andrew Arnold, Éric Schost:
A Truncated Fourier Transform middle product. ACM Commun. Comput. Algebra 48(3/4): 98-99 (2014) - [c11]Andrew Arnold, Mark Giesbrecht, Daniel S. Roche:
Sparse interpolation over finite fields via low-order roots of unity. ISSAC 2014: 27-34 - [c10]Andrew Arnold, Daniel S. Roche:
Multivariate sparse interpolation using randomized Kronecker substitutions. ISSAC 2014: 35-42 - [i5]Andrew Arnold, Mark Giesbrecht, Daniel S. Roche:
Faster sparse polynomial interpolation of straight-line programs over finite fields. CoRR abs/1401.4744 (2014) - [i4]Andrew Arnold, Daniel S. Roche:
Multivariate sparse interpolation using randomized Kronecker substitutions. CoRR abs/1401.6694 (2014) - [i3]Andrew Arnold, Mark Giesbrecht, Daniel S. Roche:
Faster Sparse Multivariate Polynomial Interpolation of Straight-Line Programs. CoRR abs/1412.4088 (2014) - 2013
- [j6]Andrew Arnold, Mark Giesbrecht, Daniel S. Roche:
Recursive sparse interpolation. ACM Commun. Comput. Algebra 47(3/4): 104-105 (2013) - [c9]Andrew Arnold, Mark Giesbrecht, Daniel S. Roche:
Faster Sparse Interpolation of Straight-Line Programs. CASC 2013: 61-74 - [c8]Andrew Arnold:
A new truncated fourier transform algorithm. ISSAC 2013: 15-22 - [i2]Andrew Arnold, Mark Giesbrecht, Daniel S. Roche:
Faster sparse interpolation of straight-line program. CoRR abs/1304.3483 (2013) - 2012
- [i1]Andrew Arnold:
A new in-place truncated Fourier transform algorithm. CoRR abs/1210.4960 (2012) - 2011
- [j5]Andrew Arnold, Michael B. Monagan:
Calculating cyclotomic polynomials. Math. Comput. 80(276): 2359-2379 (2011) - 2010
- [j4]Andrew Arnold, Michael B. Monagan:
A fast recursive algorithm for computing cyclotomic polynomials. ACM Commun. Comput. Algebra 44(3/4): 89-90 (2010) - [j3]Amr Ahmed, Andrew Arnold, Luís Pedro Coelho, Joshua D. Kangas, Abdul-Saboor Sheikh, Eric P. Xing, William W. Cohen, Robert F. Murphy:
Structured literature image finder: Parsing text and figures in biomedical literature. J. Web Semant. 8(2-3): 151-154 (2010) - [c7]Andrew Arnold, Michael B. Monagan:
A high-performance algorithm for calculating cyclotomic polynomials. PASCO 2010: 112-120
2000 – 2009
- 2009
- [c6]Andrew Arnold, William W. Cohen:
Information Extraction as Link Prediction: Using Curated Citation Networks to Improve Gene Detection. ICWSM 2009 - [c5]Andrew Arnold, William W. Cohen:
Information Extraction as Link Prediction: Using Curated Citation Networks to Improve Gene Detection. WASA 2009: 541-550 - 2008
- [j2]Andrew Arnold, Michael B. Monagan:
Calculating really big cyclotomic polynomials (abstract only). ACM Commun. Comput. Algebra 42(1-2): 48-49 (2008) - [c4]Andrew Arnold, William W. Cohen:
Intra-document structural frequency features for semi-supervised domain adaptation. CIKM 2008: 1291-1300 - [c3]Luís Pedro Coelho, Amr Ahmed, Andrew Arnold, Joshua D. Kangas, Abdul-Saboor Sheikh, Eric P. Xing, William W. Cohen, Robert F. Murphy:
Structured Literature Image Finder: Extracting Information from Text and Images in Biomedical Literature. BioLINK@ISMB/ECCB 2008: 23-32 - [c2]Xiubo Geng, Tie-Yan Liu, Tao Qin, Andrew Arnold, Hang Li, Heung-Yeung Shum:
Query dependent ranking using K-nearest neighbor. SIGIR 2008: 115-122 - 2007
- [c1]Andrew Arnold, Yan Liu, Naoki Abe:
Temporal causal modeling with graphical granger methods. KDD 2007: 66-75 - 2004
- [j1]Kristinn R. Thórisson, Hrvoje Benko, Denis Abramov, Andrew Arnold, Sameer Maskey, Aruchunan Vaseekaran:
Constructionist Design Methodology for Interactive Intelligences. AI Mag. 25(4): 77-90 (2004) - 2002
- [p1]Eleazar Eskin, Andrew Arnold, Michael J. Prerau, Leonid Portnoy, Salvatore J. Stolfo:
A Geometric Framework for Unsupervised Anomaly Detection. Applications of Data Mining in Computer Security 2002: 77-101
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-25 05: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:
