|
Member 9963602 wrote: I am a complete novice and have little to know idea what i am talking about so try not to be too wordy in your explinations.
Understanding or knowing the problem is the first solution. So define exactly what your aims are and will guide you.  . I don't get the part "create an algorithm based around a name or word",please clarify.
“Everything is simple when you take your time to analyze it.”
|
|
|
|
|
What are the approaches used for horizontal/vertical alignment and rectification of inaccurately orientated polylines?
inaccurately alligned structure
I believe as a starting point a graph representation is needed for further processing
Чесноков
|
|
|
|
|
Your problem seem to exists of creating 90 or 180 degree angles between all your lines? I dont think theres an algorithem for that. Personally I would do something different, like holding down the shift hey to only allow 90 degree bends:
WPF-Drawing Canvas Control[^]
|
|
|
|
|
What about creating a grid and moving every point to the nearest valid position? This raises a problem when two points are almost in line, but unfortunately fall into diffferent grid lines. This special case would have to be taken care of manually (and checked after each point aligment performed, as the situation is going to change in time).
Greetings - Jacek
|
|
|
|
|
The other one is on binary tree. I do appreciate the guidline and how to prove that.
Thanks,
Amit
|
|
|
|
|
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
|
|
|
|
|
|
This question is from DATA STRUCTURE & Algorithms
|
|
|
|
|
You have asked for someone else to do your work for you. That's not how things operate here.
Use the best guess
|
|
|
|
|
We have a tree spec and definitions for n and I. What is a statement to prove?
Greetings - Jacek
|
|
|
|
|
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...
|
|
|
|
|
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).
|
|
|
|
|
|
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
|
|
|
|
|
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.”
|
|
|
|
|
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
|
|
|
|
|
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.
|
|
|
|
|
|
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.”
|
|
|
|
|
|
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.
|
|
|
|
|
Find a tokenizer and learn the interpreter-pattern.
|
|
|
|
|
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.
|
|
|
|
|
You may have a look at flex/bison, generating lexical scanner and parser (formerly known as lex/yacc).
|
|
|
|
|
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?
|
|
|
|
General 
News 
Suggestion 
Question 
Bug 
Answer 
Joke 
Praise 
Rant 
Admin 
Submit an article or tip
