default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKalpana Dahiya
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j15]Supinder Kaur
, Ekta Jain, Anuj Sharma, Kalpana Dahiya:
An efficient algorithm for two-stage capacitated time minimization transportation problem with restricted flow. RAIRO Oper. Res. 58(4): 2733-2766 (2024)- 2022
- [j14]Prabhjot Kaur, Anuj Sharma, Vanita Verma, Kalpana Dahiya:
An alternate approach to solve two-level hierarchical time minimization transportation problem. 4OR 20(1): 23-61 (2022) - [j13]Ekta Jain, Kalpana Dahiya, Anuj Sharma, Vanita Verma:
Task preference-based bottleneck assignment problem. Comput. Appl. Math. 41(7) (2022) - 2021
- [j12]Vinod Kumar Chauhan, Anuj Sharma, Kalpana Dahiya:
LIBS2ML: A library for scalable second order machine learning algorithms. Softw. Impacts 10: 100123 (2021) - 2020
- [j11]Vinod Kumar Chauhan, Anuj Sharma, Kalpana Dahiya:
Stochastic trust region inexact Newton method for large-scale machine learning. Int. J. Mach. Learn. Cybern. 11(7): 1541-1555 (2020) - 2019
- [j10]Vinod Kumar Chauhan, Kalpana Dahiya, Anuj Sharma:
Problem formulations and solvers in linear SVM: a review. Artif. Intell. Rev. 52(2): 803-855 (2019) - [j9]Vinod Kumar Chauhan, Anuj Sharma, Kalpana Dahiya:
SAAGs: Biased stochastic variance reduction methods for large-scale learning. Appl. Intell. 49(9): 3331-3361 (2019) - [j8]Ekta Jain, Kalpana Dahiya, Anuj Sharma, Vanita Verma:
An improved algorithm for two stage time minimization assignment problem. J. Comb. Optim. 37(2): 713-736 (2019) - 2018
- [j7]Ekta Jain, Kalpana Dahiya, Vanita Verma:
Integer quadratic fractional programming problems with bounded variables. Ann. Oper. Res. 269(1-2): 269-295 (2018) - [j6]Vinod Kumar Chauhan, Anuj Sharma, Kalpana Dahiya:
Faster learning by reduction of data access time. Appl. Intell. 48(12): 4715-4729 (2018) - 2017
- [j5]Prabhjot Kaur, Vanita Verma, Kalpana Dahiya:
Capacitated two-stage time minimization transportation problem with restricted flow. RAIRO Oper. Res. 51(2): 447-467 (2017) - 2015
- [j4]Anuj Sharma, Vanita Verma, Prabhjot Kaur, Kalpana Dahiya:
An iterative algorithm for two level hierarchical time minimization transportation problem. Eur. J. Oper. Res. 246(3): 700-707 (2015) - 2010
- [j3]Vikas Sharma, Kalpana Dahiya, Vanita Verma:
Capacitated Two-Stage Time Minimization Transportation Problem. Asia Pac. J. Oper. Res. 27(4): 457-476 (2010) - 2007
- [j2]Kalpana Dahiya, Surjeet Kaur Suneja, Vanita Verma:
Convex programming with single separable constraint and bounded variables. Comput. Optim. Appl. 36(1): 67-82 (2007) - [j1]Kalpana Dahiya, Vanita Verma:
Capacitated transportation problem with bounds on RIM conditions. Eur. J. Oper. Res. 178(3): 718-737 (2007)
Conference and Workshop Papers
- 2017
- [c3]Vinod Kumar Chauhan, Kalpana Dahiya, Anuj Sharma:
Mini-batch Block-coordinate based Stochastic Average Adjusted Gradient Methods to Solve Big Data Problems. ACML 2017: 49-64 - [c2]Vinod Kumar Chauhan, Kalpana Dahiya, Anuj Sharma:
Trust Region Levenberg-Marquardt Method for Linear SVM. ICAPR 2017: 1-6 - 2016
- [c1]Kalpana Dahiya, Vinod Kumar Chauhan, Anuj Sharma:
Online Support Vector Machine Based on Minimum Euclidean Distance. CVIP (1) 2016: 89-99
Informal and Other Publications
- 2019
- [i4]Vinod Kumar Chauhan, Anuj Sharma, Kalpana Dahiya:
LIBS2ML: A Library for Scalable Second Order Machine Learning Algorithms. CoRR abs/1904.09448 (2019) - 2018
- [i3]Vinod Kumar Chauhan, Kalpana Dahiya, Anuj Sharma:
Faster Algorithms for Large-scale Machine Learning using Simple Sampling Techniques. CoRR abs/1801.05931 (2018) - [i2]Vinod Kumar Chauhan, Anuj Sharma, Kalpana Dahiya:
SAAGs: Biased Stochastic Variance Reduction Methods. CoRR abs/1807.08934 (2018) - [i1]Vinod Kumar Chauhan, Anuj Sharma, Kalpana Dahiya:
Stochastic Trust Region Inexact Newton Method for Large-scale Machine Learning. CoRR abs/1812.10426 (2018)
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-07-20 21:15 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:
