• Home
  • Deep Visual Counter
  • About Me
  • Contact

Tahir Naeem

  • Home
  • 2016
  • May

Month: May 2016

C++/Algorithems

Minimum sliding Window Problem can be solved in O(n) rather easily

minimum sliding window algorithem
Tahir Naeem / May 17, 2016

Several solutions to the minumum sliding window Problem actually create complexity but in my opinion it can solved with rather ease while still maintaining the time and Memory complexity at O(n). The idea is to basically create a temporary sum and Keep adding the new elements and subtracting the old elements as we scan the Array while keeping record of…

Read More→

Recent Posts

  • Speeding up the training of custom network models using pre-trained models’ weights
  • Different results on different batch sizes? Culprit : Batch Normalization
  • Solution: optimizer got an empty parameter list
  • NLTK vs Spacy: Performance Comparison of NLP Libraries in Text Tokenization
  • Finding closest pair of points in two disjoint sets of points

Categories

  • C++/Algorithems
  • DWH
  • Neural Networks
  • NLP

Archives

  • April 2019
  • November 2018
  • June 2018
  • May 2018
  • November 2017
  • May 2016
  • November 2015
  • August 2015
  • Imprint
Copyright © All rights reserved.
Blog Inn by ProDesigns

By continuing to use the site, you agree to the use of cookies. more information

The cookie settings on this website are set to "allow cookies" to give you the best browsing experience possible. If you continue to use this website without changing your cookie settings or you click "Accept" below then you are consenting to this.

Close