Tuesday, 7 January 2014

Jan 7

Place - Coimbatore

Started my project. Nice progress. Need to learn about cam-shift algorithm.
Codechef January problem was a big head-ache. Many WA due to unsigned long. Got accepted when I changed that to Unsigned long long. Didn't learn much .

Will update the blog from tomorrow. Even modular multiplication can be learned. Need to push my self to the next level. 

Monday, 6 January 2014

Jan 6

Place - Coimbatore

I reached Coimbatore at 9:30 in morning. Bus was very late. Came to my room freshened up and didn do much. Figured out new method to solve Codechef MTRICK problem.

Instead of brute forcing a solution we need to find a easy way to bring up the solution.
Cleaned my room and not much interesting things I learned.
Did SRM 603 solved 2. Didn get any idea for the 1000pts and need to check out and understand the solution atleast.


Sunday, 5 January 2014

Jan 5

Place - Bangalore

Started to learn void pointer, What are the use of void pointer and how you declare it.
Void Pointer
It is useful when you want to write a module that works for all type then void pointer is very useful.
We ll discuss how to declare void pointer and deference the void pointer.

Initialization void pointer
   
void *ptr;    // ptr is declared as Void pointer

char cnum;
int inum;
float fnum;
Suppose we have assigned integer Address to void pointer then -
ptr = &inum;  // ptr has address of integer data
then to De-reference this void pointer we should use following syntax -
*((int*)ptr)
Now in C++ then how with a new syntax to de-reference the variable
void *value;
print(*static_cast<float*>(value));
Today is the last day in bangalore and from tomorrow college start. Stay tuned for new adventure to come. Done with SRM 303, Need to write a blog on that.

 And read an interesting blog on conversion of top-down to bottom-up approach
http://www.quora.com/Dynamic-Programming/While-solving-a-dynamic-programming-problem-I-can-figure-out-the-top-down-approach-pretty-quickly-but-I-am-failing-to-convert-it-into-bottom-up-in-some-of-the-cases-How-should-I-approach-bottom-up-once-I-figure-out-the-top-down-approach

Saturday, 4 January 2014

Jan 4

Place - Bangalore

Project
Open CV is awesome, I learnt to use contour method to track moving object. But object tracking can be done using convex hull or we need to draw a initial rectangle and make the user to start from the initial state of the rectangle so that tracking becomes easier.

I like to share various link that was useful for me in search of tracking object using Open CV

The below mentioned site is used for hand gesture recon. Need to read and get idea.
https://github.com/sabs231/hand-gesture-recon/tree/master/Tests

The below mentioned site talks about camshift algorithm and kalman filter.
Useful for tracking moving object need to explore what that is

https://github.com/sneilan/EverythingIveDoneOverTheYears/blob/master/renderFacesWithAdsThingy/camshiftdemo.c

Yesterday SRM will be finished today. Going to start USACO training and create a blog on how to approach USACO problem with confidence. I feel USACO problem are way to good and once we solve all the problems we will to get know all the algorithm, indeed needed for competitive programming.

Those who want to start, can try creating an account here http://cerberus.delos.com:790/usacogate 

Friday, 3 January 2014

Jan 3

Place - Bangalore

Started my day by creating flow algorithm. I learnt knuh's algorithm and implemented for an problem. Now trying to use Maxflow algorithm for bipartite matching problem.
It is nice to implement the flow algorithm and learn it's working.

Instead of HSV algorithm the below mentioned gives a better result.
http://www.graphicon.ru/2003/Proceedings/Technical/paper509.pdf

Next is to start hand-tracking for the project.
Today SRM 303 is pending. Nice problem actually need to spend time on how to implement it. So giving a break won make things go wrong.

Thursday, 2 January 2014

Jan 2

Place - Bangalore

Started my day by learning bipartite graph. Abhiram Randhe professor video lectures is very good.
I would recommend starters to learn from it. Implemented maximum flow algorithm using bfs. Need to try it using pfs(priority first search).
Got cool blogs from topcoder need to spend sometime on reading these blogs.

Maximum flow algorithm topics is covered in this blog.
http://apps.topcoder.com/forums/?module=ThreadList&forumID=505876&mc=90

Got the above blog from.
http://apps.topcoder.com/forums/?module=Category&categoryID=8&sortField=9&sortOrder=0&start=0

Algorithm cook-book (includes advanced dp and cool algorithm need to look on)
http://apps.topcoder.com/forums/?module=ThreadList&forumID=534587&mc=412

Didn spend time on project need to balance time. Solved an SRM 302.

People who wanted to improve chess tactics can try this site, found this site recently.
http://chesstempo.com/



Wednesday, 1 January 2014

Jan 1st 2014 (It's a New Year)


Place - Bangalore

Learn number theory. Got many interesting resources to learn advanced data structures including heavy light decomposition. Today's plan is to implement maxflow algorithm and solve at-least one problem.

Maxflow is one cool concept and it's application are many.
Today I need solve at-least one srm and I haven solved the srm 300 div21000 pts.
Starting my day with srm 300 div21000 pts.

Cool blog http://praveendhinwacoding.blogspot.in/2013/06/700-problems-to-understand-you-complete.html
Consist of complete reference to learn segment tree, BIT, and also dp.
Need to solve 3-4 dp problem today. Brush up old concept and implement it.
My new-year resolution start using git-up and upload the implemented algorithm :).
Wishing everyone in the world a happy new-year.

Many of us know have to traverse array in anticlockwise manner but I wanted to share this neat code, come in handy for many cases.
Let n denote number of element in the array. startedpos denotes the starting index of the number.

for(int i=(startedpos+n-1)%n ; i!=startedpos; i=(i+n-1)%n);