Rank: 500 based on 200 downloads (last 30 days) and 10 files submitted
photo

Hanan Kavitz

E-mail
Company/University
Applied Materials

Personal Profile:
Professional Interests:
machine learning, optimization

 

Watch this Author's files

 

Files Posted by Hanan View all
Updated   File Tags Downloads
(last 30 days)
Comments Rating
24 Jan 2013 Price call and put options using Constant Elasticy of Variance model An alternative to using Black and Scholes model is using Constant Elasticity of Variance model. Author: Hanan Kavitz financial models, black and shcoules, constant elasticity m..., cev, bs, black and schoules 18 0
24 Jan 2013 Screenshot Black and Shcoles calculator Graphical Black and Shcoles calculator for visualizing different sensetives Author: Hanan Kavitz bls, black and shcoles, gui, finance, options, options trading 14 2
  • 5.0
5.0 | 1 rating
27 Nov 2012 Screenshot Genetic Packman A simple demonstration of Genetic Algorithm using all times favorite game. Author: Hanan Kavitz optimization, global optimization, genetic algorithm, packman 15 0
05 Nov 2012 Screenshot Credit Scoring demo This is a demo that uses boosting to do credit scoring of German customers. Author: Hanan Kavitz statistics, boosting, classification, ensamble method, credit scoring 16 0
01 Nov 2012 Screenshot Image reconstruction The purpose of this demo is to reconstruct a simple picture of several polygons. Author: Hanan Kavitz genetic algorithm, global optimization, image reconstruction, optimization, image processing 27 0
Comments and Ratings by Hanan View all
Updated File Comments Rating
04 Jun 2013 Mosaic generator Photo mosaic generator. Choose a tile image, and a directory with images, and see the magic. Author: Nikolay S.

24 Jan 2013 Black and Shcoles calculator Graphical Black and Shcoles calculator for visualizing different sensetives Author: Hanan Kavitz

Roberto Thanks, I corrected it.

24 Dec 2011 Heap heap data type Author: Hanan Kavitz

Derec Hello,
Heap is a very usefull data type used in many algorithms primarily due to the fact that you can get maximum number in the heap with runtime of O(1) and extracting maximum(or minimum) with runtime of O(logn).
What I meant is that sorting is done, in this case, much slower than just using sort(A).
For any other operation with Heap this code is good.

Comments and Ratings on Hanan's Files View all
Updated File Comment by Comments Rating
19 Jun 2014 Knapsack problem A well known combinatorial problem Author: Hanan Kavitz reala

Thank you for your file.
I am working with a variable capacity and resolving for each of its value the knapsack algorithm with Dynmic programming.
I would like to know how can I, at the end of the resolution, find the best value of the capacity that gvies the optimal solution of the Knapsack.
Thank you in advance.

07 May 2014 Heap heap data type Author: Hanan Kavitz Yasha

The description should mention that this heap only sorts keys and does not support key-value pairs.

25 Apr 2014 Knapsack problem A well known combinatorial problem Author: Hanan Kavitz Newell, Andrew

This is really a tutorial. It would be better to turn it into a script, with better explanations, and publish it. Also, in the pie charts the title writes over a couple of the numbers, making it a barely readable mess.

24 Jan 2013 Black and Shcoles calculator Graphical Black and Shcoles calculator for visualizing different sensetives Author: Hanan Kavitz Kavitz, Hanan

Roberto Thanks, I corrected it.

23 Jan 2013 Black and Shcoles calculator Graphical Black and Shcoles calculator for visualizing different sensetives Author: Hanan Kavitz Osorio, Roberto

What's a shcole? Misspelling the title of your app leaves a terrible impression.

Contact us