default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGarry N. Newsam
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2002
[j6]Jon B. Cherrie, Richard K. Beatson, Garry N. Newsam
:
Fast Evaluation of Radial Basis Functions: Methods for Generalized Multiquadrics in Rn. SIAM J. Sci. Comput. 23(5): 1549-1571 (2002)- 2001
- [j5]Philip B. Chapple, Derek C. Bertilone, Robert S. Caprari, Garry N. Newsam:
Stochastic model-based processing for detection of small targets in non-Gaussian natural imagery. IEEE Trans. Image Process. 10(4): 554-564 (2001) - 1998
- [j4]Richard K. Beatson, Garry N. Newsam:
Fast Evaluation of Radial Basis Functions: Moment-Based Methods. SIAM J. Sci. Comput. 19(5): 1428-1449 (1998) - 1997
- [j3]C. R. Dietrich, Garry N. Newsam:
Fast and Exact Simulation of Stationary Gaussian Processes through Circulant Embedding of the Covariance Matrix. SIAM J. Sci. Comput. 18(4): 1088-1107 (1997) - 1996
- [j2]Nicholas J. Redding, Garry N. Newsam:
Efficient calculation of finite Gabor transforms. IEEE Trans. Signal Process. 44(2): 190-200 (1996) - 1994
- [j1]Garry N. Newsam, C. R. Dietrich:
Bounds on the size of nonnegative definite circulant embeddings of positive definite Toeplitz matrices. IEEE Trans. Inf. Theory 40(4): 1218-1220 (1994)
Conference and Workshop Papers
- 2013
- [c9]Garry N. Newsam, Michelle E. Chamalaun:
Non-decision-aided detection and SNR estimation of weak BPSK signals in AWGN. ICSPCS 2013: 1-10 - 2004
- [c8]Garry N. Newsam:
Edge and line detection as exercises in hypothesis testing. ICIP 2004: 2685-2688 - 2002
- [c7]Stephen D. Billings, Garry N. Newsam:
Fourier filtering of continuous global surfaces. DSP 2002: 803-806 - 1999
- [c6]Julian Magarey, Anthony R. Dick, Michael J. Brooks, Garry N. Newsam, Anton van den Hengel:
Incorporating the Epipolar Constraint into a Multiresolution Algorithm for Stereo Image Matching. Applied Informatics 1999: 600-603 - 1997
- [c5]Garry N. Newsam, Nicholas J. Redding:
Fitting the Most Probable Curve to Noisy Observations. ICIP (2) 1997: 752-755 - 1996
- [c4]Nicholas J. Redding, Garry N. Newsam:
A merging procedure for connecting fitted implicit polynomials for features. ANZIIS 1996: 299-303 - [c3]Danny Gibbins, Garry N. Newsam, Michael J. Brooks:
Detecting suspicious background changes in video surveillance of busy scenes. WACV 1996: 22-26 - 1994
- [c2]Nicholas J. Redding, Garry N. Newsam:
Computation and conditioning of the finite-discrete Gabor transform. ICASSP (3) 1994: 5-8 - [c1]Garry N. Newsam, Michael Wegener:
Generating non-Gaussian random fields for sea surface simulations. ICASSP (6) 1994: 195-198
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:51 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:
