Algorithms

FirstPrevNext

Consider a complete binary tree with an odd number of nodes. Let n be the number of internal nodes (non-leaves) in the tree. Define the internal path length, I, as the sum, taken over all the internal nodes of the tree, of the depth of each node. Lik amistry_petlad28-Mar-13 7:08 amistry_petlad 28-Mar-13 7:08  The other one is on binary tree. I do appreciate the guidline and how to prove that. Thanks, Amit Re: Consider a complete binary tree with an odd number of nodes. Let n be the number of internal nodes (non-leaves) in the tree. Define the internal path length, I, as the sum, taken over all the internal nodes of the tree, of the depth of each node. R. Giskard Reventlov28-Mar-13 7:24 R. Giskard Reventlov 28-Mar-13 7:24  Both of your questions sound a lot like homework. We don't do homework. "If you think it's expensive to hire a professional to do the job, wait until you hire an amateur." Red Adair. nils illegitimus carborundum me, me, me Re: Consider a complete binary tree with an odd number of nodes. Let n be the number of internal nodes (non-leaves) in the tree. Define the internal path length, I, as the sum, taken over all the internal nodes of the tree, of the depth of each node. Richard MacCutchan28-Mar-13 7:25 Richard MacCutchan 28-Mar-13 7:25  See http://www.codeproject.com/Messages/2966804/How-to-get-an-answer-to-your-question.aspx[^]. Use the best guess Re: Consider a complete binary tree with an odd number of nodes. Let n be the number of internal nodes (non-leaves) in the tree. Define the internal path length, I, as the sum, taken over all the internal nodes of the tree, of the depth of each node. amistry_petlad28-Mar-13 7:51 amistry_petlad 28-Mar-13 7:51  This question is from DATA STRUCTURE & Algorithms Re: Consider a complete binary tree with an odd number of nodes. Let n be the number of internal nodes (non-leaves) in the tree. Define the internal path length, I, as the sum, taken over all the internal nodes of the tree, of the depth of each node. Richard MacCutchan28-Mar-13 7:58 Richard MacCutchan 28-Mar-13 7:58  You have asked for someone else to do your work for you. That's not how things operate here. Use the best guess Re: Consider a complete binary tree with an odd number of nodes. Let n be the number of internal nodes (non-leaves) in the tree. Define the internal path length, I, as the sum, taken over all the internal nodes of the tree, of the depth of each node. Lutosław4-Jun-13 13:06 Lutosław 4-Jun-13 13:06  We have a tree spec and definitions for n and I. What is a statement to prove? Greetings - Jacek The degree of a node in a tree is the number of children the node has. If a tree has n1 nodes of degree 1, n2 nodes of degree 2, ..., nm nodes of degree m, compute the number of leaves in the tree in terms of n1, n2, . . . , nm. amistry_petlad28-Mar-13 7:04 amistry_petlad 28-Mar-13 7:04  Full question is below . Consider a complete binary tree with an odd number of nodes. Let n be the number of internal nodes (non-leaves) in the tree. Define the internal path length, I, as the sum, taken over all the internal nodes of the tree, of the depth of each node. Likewise, define the external pathlength, E, as the sum, taken over all the leaves of the tree, of the depth of each leaf. Show that E = I + 2n Can some one guide me for the above subject line I greatly appreciate Thanks in Advance... Caltech's FREE online Machine Learning course -- LAST CHANCE Matt T Heffron27-Mar-13 11:53 Matt T Heffron 27-Mar-13 11:53  Upcoming (next week!) is the First Anniversary Session of Caltech's online Machine Learning course (http://work.caltech.edu/telecourse[^]) . It is also the final session. There will be no future sessions. The course has attracted more than 200,000 participants since its launch last year, and has gained wide acclaim. This is the last chance for anyone who wishes to take the course. I took this course last fall and I highly recommend this! It is well done, with video lectures on YouTube (so you don't need to "attend" at a specific time). There is an on-line forum for discussion with Teaching Assistant(s) and other participants. The text is an excellent book (a good value on Amazon). New computer vision algorithms, check out the videos BupeChombaDerrick20-Feb-13 20:33 BupeChombaDerrick 20-Feb-13 20:33  Developed a full object recognition algorithm from ground up, out performs Scale Invariant Feature transform (SIFT) http://en.wikipedia.org/wiki/Scale-invariant_feature_transform[^] and Speeded Up Robust Features (SURF) http://en.wikipedia.org/wiki/SURF[^] and the best documented computer vision systems to date. Check out the demo videos of the system here: http://www.youtube.com/watch?v=euHMcUfqpVo[^] http://www.youtube.com/watch?v=PZr7v-jMeOo[^] http://www.youtube.com/watch?v=tmxG7_MahYY[^] http://www.youtube.com/watch?v=35U6-nqdV3A[^] http://www.youtube.com/watch?v=9cAdZQqIIDU[^] http://www.youtube.com/watch?v=WxiwDgaCZ_A[^] Thanks for your time, I plan on creating an image based product advertising system, similar to Google Goggles but obviously better. “Everything is simple when you take your time to analyze it.” Re: New computer vision algorithms, check out the videos Simon_Whale1-Mar-13 0:13 Simon_Whale 1-Mar-13 0:13  May be an article on the subject would be better? Lobster Thermidor aux crevettes with a Mornay sauce, served in a Provençale manner with shallots and aubergines, garnished with truffle pate, brandy and a fried egg on top and Spam - Monty Python Spam Sketch Re: New computer vision algorithms, check out the videos BupeChombaDerrick1-Mar-13 23:24 BupeChombaDerrick 1-Mar-13 23:24  I was rather thinking of going commercial, I made the videos because people wanted to see what I was working on.Right now I'am making android apps using the same technology, they will be on Google Play in about two months time from now. “Everything is simple when you take your time to analyze it.” Complexity and Routing Problems brkonja18-Feb-13 13:10 brkonja 18-Feb-13 13:10  Hello, I know that the Traveling Salesman Problem has a solution space of (n-1)! / 2 for n = nodes, when the symetrick TSP is considered. But, is there any mathematical way to show how big a solution space a Arc Routing Problem, like the Capacitated Arc Routing Problem have? Or any other way to show (describe) why ít is a complex problem? In all the literature it is only described as NP-hard, and thats it. Thanks Re: Complexity and Routing Problems Alan Balkany21-Feb-13 4:24 Alan Balkany 21-Feb-13 4:24  The standard way to show a problem is NP is to show that it reduces to a known NP problem. In other words, you show transformations (which must run in P (polynomial) time) that transform any instance of the problem to an instance of a known NP problem. Re: Complexity and Routing Problems BupeChombaDerrick21-Feb-13 20:38 BupeChombaDerrick 21-Feb-13 20:38  If you are interested in image processing, you might want to take a look at this http://www.youtube.com/watch?v=euHMcUfqpVo[^] “Everything is simple when you take your time to analyze it.” Linear algebra jacobi Singular Value Decomposition (SVD) algorithm BupeChombaDerrick12-Feb-13 20:25 BupeChombaDerrick 12-Feb-13 20:25  Hello out there, I have been working on a project to design a new computer vision system and I have succeeded, the only stage remaining is the homography estimation stage.But to estimate the homography matrix the algorithm has to compute the singular value decomposition or svd of the measurement matrix. I can easily use openCV or LAPACK for that but I want to implement my own Jacobi SVD method and the openCV and Lapack are too big, I don't want my computer vision system library to be dependent on them. Does anyone have a copyright free example code of a fast jacobi svd implementation that I can modify without using the big free libraries? I want a simplified implementation, even pseudocode would suffice. I will create a tech demo video for this computer vision system. It out performs state of the art systems in object detection/recognition. I'am surely going to acknowledge any help I can get. Thanks in advance. “Everything is simple when you take your time to analyze it.” Re: Linear algebra jacobi Singular Value Decomposition (SVD) algorithm BupeChombaDerrick13-Feb-13 19:32 BupeChombaDerrick 13-Feb-13 19:32  Okay I found the solution personally http://www.math.pitt.edu/~sussmanm/2071Spring08/lab09/lab09.pdf[^], but if you have a better solution I would like to have a look at it. “Everything is simple when you take your time to analyze it.” Algorithm for creating new parser somanath kavalase1-Feb-13 21:18 somanath kavalase 1-Feb-13 21:18  I am going to implementing my own new query language for retrieving the web data. For that purpose i need an efficient algorithm for design new <b>parser</b>. What will the steps to design new parser. Re: Algorithm for creating new parser Eddy Vluggen2-Feb-13 0:52 Eddy Vluggen 2-Feb-13 0:52  Find a tokenizer and learn the interpreter-pattern. Bastard Programmer from Hell If you can't read my code, try converting it here[^] They hate us for our freedom![^] Re: Algorithm for creating new parser jschell2-Feb-13 7:55 jschell 2-Feb-13 7:55  First step of course is to design the language. Other than that, generally parsers do not need to be efficient because parsing shouldn't be significant, rather running should be. And that would be interpretation or execution. Re: Algorithm for creating new parser sep11-Feb-13 4:18 sep 11-Feb-13 4:18  You may have a look at flex/bison, generating lexical scanner and parser (formerly known as lex/yacc). language translation serena simmy30-Jan-13 18:12 serena simmy 30-Jan-13 18:12  i am doing a language translation app to convert trini vernacular in to standard english.. i have just started.. i am considering to use the boyer more algorithm to do the matching.. is this a good idea? and what else can any one suggest? Re: language translation Alan Balkany1-Feb-13 5:04 Alan Balkany 1-Feb-13 5:04  Boyer Moore string searching is efficient for searching large volumes of text, but translation usually involves more than just mechanically replacing one set of strings with another. You might want to look at Lex and Yacc, e.g. http://dinosaur.compilertools.net/[^] Re: language translation serena simmy2-Feb-13 2:35 serena simmy 2-Feb-13 2:35  hey thank you soo much... this really gives me a good head start.. ... i dont have any IT experience in working , but to tell the truth i love it.. it intrigues me alot.. hence the reason why i am doing my degree in computing and information systems...... the links u sent me is awe some.. i will keep asking questions... please dont laugh if i ask questions that you may think is foolish lol.. because like i said im really new.. my project is dues in may and i have alot of work to put out u knw... AES algorithm lamar nadeen16-Jan-13 4:36 lamar nadeen 16-Jan-13 4:36  can any bady help me I need the AES algorithm code plzzzzzzzzzzzzzzzzzzzzzzzzzz Re: AES algorithm Alan N16-Jan-13 5:10 Alan N 16-Jan-13 5:10  I'm sure some good soul will be along soon but while you're waiting try typing "AES algorithm" into Google or Bing.

Last Visit: 31-Dec-99 18:00     Last Update: 25-Apr-24 22:10 Refresh ᐊ Prev1...66676869707172737475 Next ᐅ

General    News    Suggestion    Question    Bug    Answer    Joke    Praise    Rant    Admin   

Use Ctrl+Left/Right to switch messages, Ctrl+Up/Down to switch threads, Ctrl+Shift+Left/Right to switch pages.