default search action
Ryan R. Curtin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c16]Fred Lu
, Ryan R. Curtin
High-Dimensional Distributed Sparse Classification with Scalable Communication-Efficient Global Updates. KDD 2024: 2037-2047 - [i24]Fred Lu, Ryan R. Curtin, Edward Raff, Francis Ferraro, James Holt:
Optimizing the Optimal Weighted Average: Efficient Distributed Sparse Classification. CoRR abs/2406.01753 (2024) - [i23]Fred Lu, Ryan R. Curtin, Edward Raff, Francis Ferraro, James Holt:
High-Dimensional Distributed Sparse Classification with Scalable Communication-Efficient Global Updates. CoRR abs/2407.06346 (2024) - 2023
- [j10]Ryan R. Curtin
mlpack 4: a fast, header-only C++ machine learning library. J. Open Source Softw. 8(82): 5026 (2023) - [i22]Ryan R. Curtin, Marcus Edel, Omar Shrit, Shubham Agrawal, Suryoday Basak, James Joseph Balamuta, Ryan Birmingham, Kartik Dutt, Dirk Eddelbuettel, Rishabh Garg, Shikhar Jaiswal, Aakash Kaushik, Sangyeon Kim, Anjishnu Mukherjee, Nanubala Gnana Sai, Nippun Sharma, Yashwant Singh Parihar, Roshan Swain, Conrad Sanderson:
mlpack 4: a fast, header-only C++ machine learning library. CoRR abs/2302.00820 (2023) - [i21]Ryan R. Curtin, Marcus Edel, Conrad Sanderson:
Bandicoot: C++ Library for GPU Linear Algebra and Scientific Computing. CoRR abs/2308.03120 (2023) - 2021
- [j9]Ryan R. Curtin, Marcus Edel, Rahul Ganesh Prabhu, Suryoday Basak, Zhihao Lou, Conrad Sanderson:
The ensmallen library for flexible numerical optimization. J. Mach. Learn. Res. 22: 166:1-166:6 (2021) - [c15]Mahmoud Abo Khamis
An Approximation Algorithm for the Matrix Tree Multiplication Problem. MFCS 2021: 6:1-6:14 - [i20]Ryan R. Curtin, Marcus Edel, Rahul Ganesh Prabhu, Suryoday Basak, Zhihao Lou, Conrad Sanderson:
The ensmallen library for flexible numerical optimization. CoRR abs/2108.12981 (2021) - 2020
- [j8]Mahmoud Abo Khamis
Functional Aggregate Queries with Additive Inequalities. ACM Trans. Database Syst. 45(4): 17:1-17:41 (2020) - [c14]Alireza Samadian, Kirk Pruhs, Benjamin Moseley, Sungjin Im, Ryan R. Curtin:
Unconditional Coresets for Regularized Loss Minimization. AISTATS 2020: 482-492 - [c13]Ryan R. Curtin, Benjamin Moseley, Hung Q. Ngo, XuanLong Nguyen, Dan Olteanu, Maximilian Schleich:
Rk-means: Fast Clustering for Relational Data. AISTATS 2020: 2742-2752 - [c12]Conrad Sanderson, Ryan R. Curtin:
An Adaptive Solver for Systems of Linear Equations. ICSPCS 2020: 1-6 - [i19]Ryan R. Curtin, Marcus Edel, Rahul Ganesh Prabhu, Suryoday Basak, Zhihao Lou, Conrad Sanderson:
Flexible numerical optimization with ensmallen. CoRR abs/2003.04103 (2020) - [i18]Conrad Sanderson, Ryan R. Curtin:
An Adaptive Solver for Systems of Linear Equations. CoRR abs/2007.11208 (2020)
2010 – 2019
- 2019
- [j7]Ryan R. Curtin, Javier R. Echauz, Andrew B. Gardner:
Exploiting the structure of furthest neighbor search for fast approximate results. Inf. Syst. 80: 124-135 (2019) - [c11]Ryan R. Curtin, Andrew B. Gardner, Slawomir Grzonkowski, Alexey Kleymenov, Alejandro Mosquera
Detecting DGA domains with recurrent neural networks and side information. ARES 2019: 20:1-20:10 - [c10]Mahmoud Abo Khamis
On Functional Aggregate Queries with Additive Inequalities. PODS 2019: 414-431 - [i17]Ryan R. Curtin, Sungjin Im, Benjamin Moseley, Kirk Pruhs, Alireza Samadian:
On Coresets for Regularized Loss Minimization. CoRR abs/1905.10845 (2019) - [i16]Ryan R. Curtin, Benjamin Moseley, Hung Q. Ngo, XuanLong Nguyen, Dan Olteanu, Maximilian Schleich:
Rk-means: Fast Clustering for Relational Data. CoRR abs/1910.04939 (2019) - 2018
- [j6]Ryan R. Curtin
mlpack 3: a fast, flexible machine learning library. J. Open Source Softw. 3(26): 726 (2018) - [c9]Conrad Sanderson, Ryan R. Curtin:
A User-Friendly Hybrid Sparse Matrix Class in C++. ICMS 2018: 422-430 - [i15]Conrad Sanderson, Ryan R. Curtin:
A User-Friendly Hybrid Sparse Matrix Class in C++. CoRR abs/1805.03380 (2018) - [i14]Ryan R. Curtin, Andrew B. Gardner, Slawomir Grzonkowski, Alexey Kleymenov, Alejandro Mosquera:
Detecting DGA domains with recurrent neural networks and side information. CoRR abs/1810.02023 (2018) - [i13]Shikhar Bhardwaj, Ryan R. Curtin, Marcus Edel, Yannis Mentekidis, Conrad Sanderson:
ensmallen: a flexible C++ library for efficient function optimization. CoRR abs/1810.09361 (2018) - [i12]Conrad Sanderson, Ryan R. Curtin:
User-Friendly Sparse Matrices with Hybrid Storage and Template-Based Expression Optimisation. CoRR abs/1811.08768 (2018) - [i11]Mahmoud Abo Khamis, Ryan R. Curtin, Benjamin Moseley, Hung Q. Ngo, XuanLong Nguyen, Dan Olteanu, Maximilian Schleich:
On Functional Aggregate Queries with Additive Inequalities. CoRR abs/1812.09526 (2018) - 2017
- [j5]Conrad Sanderson, Ryan R. Curtin:
gmm_diag and gmm_full: C++ classes for multi-threaded Gaussian mixture models and Expectation-Maximisation. J. Open Source Softw. 2(18): 365 (2017) - [c8]Conrad Sanderson, Ryan R. Curtin:
An open source C++ implementation of multi-threaded Gaussian mixture models, k-means and expectation maximisation. ICSPCS 2017: 1-8 - [c7]Ryan R. Curtin:
A Dual-Tree Algorithm for Fast k-means Clustering With Large k. SDM 2017: 300-308 - [i10]Reuben Feinman, Ryan R. Curtin, Saurabh Shintre, Andrew B. Gardner:
Detecting Adversarial Samples from Artifacts. CoRR abs/1703.00410 (2017) - [i9]Conrad Sanderson, Ryan R. Curtin:
An Open Source C++ Implementation of Multi-Threaded Gaussian Mixture Models, k-Means and Expectation Maximisation. CoRR abs/1707.09094 (2017) - [i8]Ryan R. Curtin, Marcus Edel:
Designing and building the mlpack open-source machine learning library. CoRR abs/1708.05279 (2017) - [i7]Ryan R. Curtin, Shikhar Bhardwaj, Marcus Edel, Yannis Mentekidis:
A generic and fast C++ optimization framework. CoRR abs/1711.06581 (2017) - 2016
- [b1]Ryan R. Curtin:
Improving dual-tree algorithms. Georgia Institute of Technology, Atlanta, GA, USA, 2016 - [j4]Conrad Sanderson, Ryan R. Curtin:
Armadillo: a template-based C++ library for linear algebra. J. Open Source Softw. 1(2): 26 (2016) - [c6]Ryan R. Curtin, Andrew B. Gardner:
Fast Approximate Furthest Neighbors with Data-Dependent Candidate Selection. SISAP 2016: 221-235 - [i6]Ryan R. Curtin:
Dual-tree $k$-means with bounded iteration runtime. CoRR abs/1601.03754 (2016) - [i5]Ryan R. Curtin, Andrew B. Gardner:
Fast approximate furthest neighbors with data-dependent hashing. CoRR abs/1605.09784 (2016) - 2015
- [j3]Ryan R. Curtin, Dongryeol Lee, William B. March, Parikshit Ram:
Plug-and-play dual-tree algorithm runtime analysis. J. Mach. Learn. Res. 16: 3269-3297 (2015) - [c5]Ryan R. Curtin:
Faster Dual-Tree Traversal for Nearest Neighbor Search. SISAP 2015: 77-89 - [i4]Ryan R. Curtin, Dongryeol Lee, William B. March, Parikshit Ram:
Plug-and-play dual-tree algorithm runtime analysis. CoRR abs/1501.05222 (2015) - 2014
- [j2]Ryan R. Curtin, Parikshit Ram:
Dual-tree fast exact max-kernel search. Stat. Anal. Data Min. 7(4): 229-253 (2014) - [c4]Ryan R. Curtin, Wayne Daley, David V. Anderson:
Classifying broiler chicken condition using audio data. GlobalSIP 2014: 1141-1144 - 2013
- [j1]Ryan R. Curtin, James R. Cline, N. P. Slagle, William B. March, Parikshit Ram, Nishant A. Mehta, Alexander G. Gray:
MLPACK: a scalable C++ machine learning library. J. Mach. Learn. Res. 14(1): 801-805 (2013) - [c3]Ryan R. Curtin, William B. March, Parikshit Ram, David V. Anderson, Alexander G. Gray, Charles L. Isbell Jr.:
Tree-Independent Dual-Tree Algorithms. ICML (3) 2013: 1435-1443 - [c2]Ryan R. Curtin, Alexander G. Gray, Parikshit Ram:
Fast Exact Max-Kernel Search. SDM 2013: 1-9 - [i3]Ryan R. Curtin, William B. March, Parikshit Ram, David V. Anderson, Alexander G. Gray, Charles Lee Isbell Jr.:
Tree-Independent Dual-Tree Algorithms. CoRR abs/1304.4327 (2013) - 2012
- [i2]Ryan R. Curtin, Parikshit Ram, Alexander G. Gray:
Fast Exact Max-Kernel Search. CoRR abs/1210.6287 (2012) - [i1]Ryan R. Curtin, James R. Cline, N. P. Slagle, William B. March, Parikshit Ram, Nishant A. Mehta, Alexander G. Gray:
MLPACK: A Scalable C++ Machine Learning Library. CoRR abs/1210.6293 (2012) - 2011
- [c1]Ryan R. Curtin, Nikolaos Vasiloglou, David V. Anderson:
Learning distances to improve phoneme classification. MLSP 2011: 1-6
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-09-13 01:41 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: