default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDouglas P. Hardin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j18]Peter G. Boyvalenkov
, Peter D. Dragnev, Douglas P. Hardin, Edward B. Saff, Maya Stoyanova:
Bounds for spherical codes: The Levenshtein framework lifted. Math. Comput. 90(329): 1323-1356 (2021)- [j17]Peter G. Boyvalenkov, Peter D. Dragnev, Douglas P. Hardin, Edward B. Saff, Maya Stoyanova:
Universal Bounds for Size and Energy of Codes of Given Minimum and Maximum Distances. IEEE Trans. Inf. Theory 67(6): 3569-3584 (2021) - 2020
- [j16]Peter G. Boyvalenkov, Peter D. Dragnev, Douglas P. Hardin, Edward B. Saff, Maya Stoyanova:
Upper bounds for energies of spherical codes of given cardinality and separation. Des. Codes Cryptogr. 88(9): 1811-1826 (2020) - [j15]Laurent Baratchart, Cristobal Villalobos Guillén, Douglas P. Hardin, Michael Carr Northington, Edward B. Saff:
Inverse Potential Problems for Divergence of Measures with Total Variation Regularization. Found. Comput. Math. 20(5): 1273-1307 (2020) - [i2]Xuemei Chen, Douglas P. Hardin, Edward B. Saff:
On the Search for Tight Frames of Low Coherence. CoRR abs/2002.06452 (2020)
2010 – 2019
- 2019
- [j14]Peter G. Boyvalenkov, Peter D. Dragnev, Douglas P. Hardin, Edward B. Saff, Maya Stoyanova:
On spherical codes with inner products in a prescribed interval. Des. Codes Cryptogr. 87(2-3): 299-315 (2019) - [c8]Peter G. Boyvalenkov, Peter Dragnev, Douglas P. Hardin, Edward B. Saff, Maya Stoyanova:
Linear Programming Bounds for Cardinality and Energy of Codes of Given Min and Max Distances. ISIT 2019: 1747-1751 - [c7]Peter G. Boyvalenkov, Peter Dragnev, Douglas P. Hardin, Edward B. Saff, Maya Stoyanova:
On Two Problems Concerning Universal Bounds for Codes. REDUNDANCY 2019: 58-63 - [i1]Peter G. Boyvalenkov, Peter Dragnev, Douglas P. Hardin, Edward B. Saff, Maya Stoyanova:
Universal Bounds for Size and Energy of Codes of Given Minimum and Maximum Distances. CoRR abs/1910.07274 (2019) - 2017
- [j13]Peter G. Boyvalenkov, Peter D. Dragnev, Douglas P. Hardin, Edward B. Saff, Maya Stoyanova:
Energy bounds for codes and designs in Hamming spaces. Des. Codes Cryptogr. 82(1-2): 411-433 (2017) - [j12]Peter G. Boyvalenkov, Peter D. Dragnev, Douglas P. Hardin, Edward B. Saff, Maya Stoyanova:
Universal Lower Bounds on Energy and LP-Extremal Polynomials for (4, 24)-Codes. Electron. Notes Discret. Math. 57: 91-96 (2017) - [j11]Douglas P. Hardin, Edward B. Saff, O. V. Vlasiuk:
Generating Point Configurations via Hypersingular Riesz Energy with an External Field. SIAM J. Math. Anal. 49(1): 646-673 (2017) - 2014
- [j10]Sergiy V. Borodachov, Douglas P. Hardin, Edward B. Saff:
Low Complexity Methods For Discretizing Manifolds Via Riesz Energy Minimization. Found. Comput. Math. 14(6): 1173-1208 (2014) - 2013
- [j9]Douglas P. Hardin, Amos P. Kendall, Edward B. Saff:
Polarization Optimality of Equally Spaced Points on the Circle for Discrete Potentials. Discret. Comput. Geom. 50(1): 236-243 (2013) - 2012
- [j8]Laura E. Brown, Ioannis Tsamardinos, Douglas P. Hardin:
To feature space and back: Identifying top-weighted features in polynomial Support Vector Machine models. Intell. Data Anal. 16(4): 551-579 (2012) - [j7]Douglas P. Hardin, Edward B. Saff, J. Tyler Whitehouse:
Quasi-uniformity of minimal weighted energy points on compact metric spaces. J. Complex. 28(2): 177-191 (2012)
2000 – 2009
- 2005
- [j6]Alexander R. Statnikov, Constantin F. Aliferis, Ioannis Tsamardinos, Douglas P. Hardin, Shawn Levy:
A comprehensive evaluation of multicategory classification methods for microarray gene expression cancer diagnosis. Bioinform. 21(5): 631-643 (2005) - [j5]Yindalon Aphinyanaphongs, Ioannis Tsamardinos, Alexander R. Statnikov, Douglas P. Hardin, Constantin F. Aliferis:
Research Paper: Text Categorization Models for High-Quality Article Retrieval in Internal Medicine. J. Am. Medical Informatics Assoc. 12(2): 207-216 (2005) - 2004
- [j4]Douglas P. Hardin, Thomas A. Hogan, Qiyu Sun:
The Matrix-Valued Riesz Lemma and Local Orthonormal Bases in Shift-Invariant Spaces. Adv. Comput. Math. 20(4): 367-384 (2004) - [c6]Douglas P. Hardin, Ioannis Tsamardinos, Constantin F. Aliferis:
A theoretical characterization of linear SVM-based feature selection. ICML 2004 - 2003
- [c5]Constantin F. Aliferis, Ioannis Tsamardinos, Pierre P. Massion, Alexander R. Statnikov, Nafeh Fananapazir, Douglas P. Hardin:
Machine Learning Models for Classification of Lung Cancer and Selection of Genomic Markers Using Array Gene Expression Data. FLAIRS 2003: 67-71 - [c4]Constantin F. Aliferis, Ioannis Tsamardinos, Pierre P. Massion, Alexander R. Statnikov, Douglas P. Hardin:
Why Classification Models Using Array Gene Expression Data Perform So Well: A Preliminary Investigation of Explanatory Factors. METMBS 2003: 47-53 - 2002
- [j3]George C. Donovan, Jeffrey S. Geronimo, Douglas P. Hardin:
Squeezable Orthogonal Bases: Accuracy and Smoothness. SIAM J. Numer. Anal. 40(3): 1077-1099 (2002) - [c3]Constantin F. Aliferis, Douglas P. Hardin, Pierre P. Massion:
Machine learning models for lung cancer classification using array comparative genomic hybridization. AMIA 2002 - 2001
- [j2]Kitti Attakitmongcol, Douglas P. Hardin, D. Mitchell Wilkes:
Multiwavelet prefilters. II. Optimal orthogonal prefilters. IEEE Trans. Image Process. 10(10): 1476-1487 (2001) - [c2]Kitti Attakitmongcol, Douglas P. Hardin, D. Mitchell Wilkes:
Optimal prefilters for the multiwavelet filter banks. ICASSP 2001: 3613-3616
1990 – 1999
- 1996
- [j1]Xiang-Gen Xia, Jeffrey S. Geronimo, Douglas P. Hardin, Bruce W. Suter:
Design of prefilters for discrete multiwavelet transforms. IEEE Trans. Signal Process. 44(1): 25-35 (1996) - [c1]Xiang-Gen Xia, Jeffrey S. Geronimo, Douglas P. Hardin, Bruce W. Suter:
Why and how prefiltering for discrete multiwavelet transforms. ICASSP 1996: 1578-1581
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
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:
