Times Ascent

Known as: Ascent 
Times Ascent is a weekly supplement of The Times of India newspaper, that is focused on human resource development, employment and job opportunities… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1936-2017
010020019362016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
Stochastic dual coordinate ascent (SDCA) is an effective technique for solving regularized loss minimization problems in machine… (More)
  • table 1
  • table 2
  • figure 1
Is this relevant?
Highly Cited
2013
Highly Cited
2013
Stochastic gradient descent is popular for large scale optimization but has slow convergence asymptotically due to the inherent… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2012
Highly Cited
2012
Stochastic Gradient Descent (SGD) has become popular for solving large scale supervised machine learning optimization problems… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Convex programming involves a convex set F ⊆ R and a convex function c : F → R. The goal of convex programming is to find a point… (More)
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Appearance-based image analysis techniques require fast computation of principal components of high dimensional image vectors. We… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
  • Thomas P. Minka
  • 2003
Logistic regression is a workhorse of statistics and is closely related to method s use in Machine Learning, including the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2002
Highly Cited
2002
A simplified cumulus parameterization scheme, suitable for use in GCMs, is presented. This parameterization is based on a plume… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Presents a new class of algorithms for penalized-likelihood reconstruction of attenuation maps from low-count transmission scans… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 5
Is this relevant?
Highly Cited
1993
Highly Cited
1993
1 Iterative methods for statistically-based reconstruction from projections are computationally costly relative to convolution… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1989
Highly Cited
1989
The fixed-charge network design problem arises in a variety of problem contexts including transportation, communication, and… (More)
  • figure 1.1
  • table II
Is this relevant?