 |
 |
|
|
| |
| |
| |
|
|
| Articles about Algorithm |
| SnapBomb with Unique Price Value Algorithm | | 2008-07-06 15:57:09 | | Maybe you have not heard about the new blogging marketplace called SnapBomb. The site looks pretty simple, in fact maybe too simple which may raise a few eyebrows as it did mine. Registered blogs are price valued using a top secret algorithm. After installing the codes, you have to wait one or two days to see the given price value for your blogs. Thereafter, you can head over to the opportunities page & choose to do the offered opportunities. Your blog may be price valued at $20 to $40 for example but shows only $5 at the opportunity.Add to: | Technorati | Digg | del.icio.us | Yahoo | BlinkList | Spurl | reddit | Furl | Well, it’s the highest price that the advertiser can afford to give for a single opportunity. At the moment, most of my blogs are price valued at about $2.5 each at SnapBomb so it does not make sense for me to be doing a 200 word blog post to receive such low payment. Hopefully, in the future, my blogs price value will rise for me to start doing some oppo | | By: internet executive log | | |
| | How to Write an Algorithm | | 2008-06-08 04:18:15 | | How to make a processor compute for you? Perhaps you are considering about picking up computer programming as a hobby but do not know where to start. Well, I am no computer programmer my self but I did find some few steps to have your thoughts going in the correct direction. Do take a look at the Software development method as below:Add to: | Technorati | Digg | del.icio.us | Yahoo | BlinkList | Spurl | reddit | Furl | Software development method:6) Specify the problem requirements (which commands to use)7) Analyze the problem8) Design the algorithm to solve the problem9) Implement the algorithm10) Test & verify the completed programs11) Maintain & update the programNow that you have read the above, you can proceed to find more information about computer programming & start building some simple computer programs. | | By: internet executive log | | |
| | The Google PageRank Algorithm Explained--sort of | | 2008-05-26 10:00:00 | | Unless you have a PH.d in Math be warned that the following link will just give you a headache. I've just stumbled upon this post over at DP linking to this Pagerank computation report by Northern Carolina State University students.
I tried reading it and I did manage to get past the third paragraph until my migraine suddenly attacked. Anyways, it looks like it has been up for a while and maybe | | By: Gadget Reviews and How-Tos | | |
|
|
|
| Why is Google algorithm so Important? | | 2008-04-22 04:10:58 | | Google's search engine gets more traffic than anyother Web site. So what's the company's secretalgorithm? No one can be sure.The GOOGLE algorithmGoogle's algorithm does the work for you by searching out Web pages that contain the keywords you used to search, then assigning a rank to each page based several factors, including how many times the keywords appear on the page. Higher ranked pages appear further up in Google's search engine results page (SERP), meaning that the best links relating to your search query are theoretically the first ones Google lists. For Web page administrators, being listed prominently on Google can result in a big boost in site traffic and visibility. In 2007, Google surpassed Microsoft as the most visited site on the WebAre You Down with ODP?The Open Directory Project (ODP) is a Web directory maintained by a large staff of volunteers. Each volunteer oversees a category, and together volunteers list and categorize Web sites into a huge, comprehensive director | | By: YOUNGISTAN-Land of Youth | | |
| | New Alexa Ranking Algorithm | | 2008-04-19 15:14:00 | | As I was waiting to check my new alexa ranking at that day, I got shocked by the news of Alexa changing their ranking algorithm, I was expecting a good change but it was some kind of disappointment for me!1 month ago and at the 2 months birthday of my site, I was glad to achieve a 6 Digits Alexa Traffic Ranking (Below 1 Million in less than 2 months), and the achievement was still on in the last month, going down and down till I got 502.000 total alexa rank, and around 250.000 week alexa rank for 4 to 5 weeks, so I was surely hoping to see a number like 400 thousand, but i got shocked of my new rank.All of that was a result of the new alexa ranking algorithm, as they are announcing now they are considering much factors, rather than the main old factor which was based on the alexa community (only those who use the alexa toolbar).The thing i can't get, isn't alexa community a fixed percentage of the whole web community? then how come this percentage trend is wrong to use as indicator of | | By: Rani The Brainy | Rani Dababneh | | |
| | Algorithm Analysis | | 2008-04-18 23:55:15 | | check your skill in basic algorithm analysis!!Majority ElementEuclidean AlgorithmBinary searchPrime Numbers!Sorting - Insertion SortSome Interesting Algorithm QuestionsSorting -MergeSortQuick Sort routine to find the kth smallest elemen...Run time Analysis of QuickSort ,Nature of Input,Pi...Interview questions on Sorting - Quick SortSome Basic Questions on SortingSolutions to problems in recursion analysisRecursion Analysis | | By: Technical Interview Questions | | |
|
|
|
| Some Interesting Algorithm Questions | | 2008-04-18 23:37:14 | | Here's a problem that occurs in automatic program analysis. For a set of variables x1; ...... ; xn, you are given some equality constraints, of the form "xi = xj" and some dis equality constraints, of the form "xi != xj" Is it possible to satisfy all of them? Give an efficient algorithm that takes as input m constraints over n variables and decides whether the constraints can be satisfied.What are the running times of each of these algorithms, and which would you choose? Algorithm A solves problems by dividing them into 5 subproblems of half the size, recursively solving each subproblem, and then combining the solutions in linear time. Algorithm B solves problems of size n by recursively solving two subproblems of size n-1 and then combining the solutions in constant time. Algorithm C solves problems of size n by dividing them into nine subproblems of size n=3, recursively solving each subproblem, and then combining the solutions in O(n2) time. You are given two sorted lists of size m | | By: Technical Interview Questions | | |
| | Euclidean Algorithm | | 2008-04-18 23:30:01 | | The Euclidean algorithm is an algorithm for finding the greatest common divisor of two integers.Pseudo Code:function gcd( a,b : Integer ) returns Integer{ if ( b != 0 ) return gcd( b, a mod b ) return abs(a)}ExplanationThe fact we need is that gcd(a,b) = gcd(b,a - kb) for any integer k. To see why this is true, let g be any common divisor of a and b. Then g divides a and kb (as it divides b), so it divides their difference a - kb. Conversely, let h be any common divisor of b and a - kb. Then h divides kb (as it divides b) and it divides a - kb, so it divides their sum a. Thus, the set of common divisors of a and b is the same as the set of common divisors of b and a - kb. In particular, their greatest common divisor is the same.Complexity:The estimation of the complexity of the Euclidean Algorithm is slightly tricky.We shall prove a small theorem to estimate the time complexity.Theorem: if M > N then M mod N M/2 then clearly N goes once in to M with a remainder M-N which i | | By: Technical Interview Questions | | |
| | check your skill in basic algorithm analysis!! | | 2008-04-18 23:28:17 | | one of the basic algorithms has been the exponentiation. ExponentiationThis involves raising an integer to a power (which is also an integer).The obvious algorithm to compute X^N uses N-1 multiplications.In this section we shall see a better algorithm compared to the above one. Efficient Exponentiationlong int pow(long int X, unsigned int N) { /* 1 */ if(N==0) /* 2 */ return 1; /* 3 */ else if(N==1) /* 4 */ return X; /* 5 */ else if(isEven(N)) /* 6 */ return pow( X * X, N /2); else /* 7 */ return pow( X * X, N /2)*X; } AnalysisLines 1 to 4 handle the base case of recursion. Otherwiseif N is even , we have X^N = X^N/2 * X^N/2and if N is odd, we have X^N= X^(N-1)/2 * X^(N-1)/2The number of multiplications required is clearly at most 2 log N, because at most 2 multiplications are required(if N is odd) to halve the p | | By: Technical Interview Questions | | |
| | Alexa changes ranking algorithm | | 2008-04-18 00:14:49 | | Image by tychay via Flickr
Alexa recently changed its ranking algorithms to improve the quality of website rankings
As per their announcement, Alexa is now looking at more sources of data to rank websites, and they have introduced an improved methodology to do these ranking.
You might notice some changes in your website rankings. I’ve seen some nice [...]
| | By: Online Presence | | |
| | Building embedded software using algorithm flow charts | | 2008-03-09 07:35:36 | | Embedded software consists of various functions performing particular tasks. Before writing any ASM or C code it is good to draw algorithm flow chart. Flow charts are visual method of representing inner algorithm. It is easer analyze the algorithm and write the code according to diagram.The main parts of diagram: Fig 1. Simple series instructions Fig 2. […] | | By: born4electronics1 | | |
| | Who invented the Google PageRank Algorithm | | 2008-01-13 16:08:00 | | Do you know who invented the pagrank algorithm? Maybe you know, maybe not, if you ask me, I do not know also, but since I just read it today through this webpage at pagerank, so I do know now.Google PageRank was developed at Standford University by Larry Page, and Sergery Brin. This was part of a research project for these two individuals. The project was started in 1995 and then was led to a functional prototype. In 1998, Google was founded. If you want to know about more google ranking just click the link that I provided. | | By: Sorrounded By Everything In This World | | |
| | Complex Algorithm Development,Hardcore1+yrs | | 2007-12-10 21:31:00 | | We are an premier Executive Search firm based in Bangalore, working
with some of the bigwigs of IT (Mostly American and European MNCs) in
India.
An excellent opportunity for IITs, BITsians, RECs -COMPUTER SCIENCE
Discipline
Job profile: Algorithm development - DataStructure development,
Extensive work on C/C++/Java/J2EE/.Net
Internals - End to End Research & Product Development
Job
| | By: JOB-HUNT | | |
| | Google's Algorithm | | 2007-12-10 02:17:00 | | The mighty Google Algorithm never ceases to surprise and fascinate webmasters and SEOs.We know the basics of what we need to do and why from the little G make public in their webmaster guidelines, but any further understanding of the huge supercomputer crunching power of the big G is assumed at best, and often nothing more than controversy and pure speculation.Some people claim to follow the algo in depth and be able to "game it" to get results and charge "brain surgeon" rates to do this for their clients, often with still varied results. For most SEOs though at best we have an educated guess at what Google do, and more like an uneducated guess at how they do it.Luckily however, we dont really need to know exactly the reason why (as various SEO experts have a million different theories about what the massive collective brainpower behind the Google algorithm have done and are doing) but just that it does work, and that doing what we do works very well as you can see from this morning's report for La Grande Bouffe Catering.We all have our theories based on what we have seen and done, and the results gained, but our friends at SEOmoz think theyve uncovered some of how it actually works herehttp://www.seomoz.org/blog/a-little-piece-of-the-google-algorithm-revealedso hopefully, that's all clear now then? :) - Good, lets get on with it... | | By: SEO Ibiza | | |
| | The Digg algorithm | | 2007-11-29 08:21:05 | | Have you ever wondered what it really takes for a story submitted to Digg to get to the home page? Or why a certain story—even a really good, social media friendly story—never got to the home page? I’m frequently asked the question “Hey, my story has [number] of Diggs but it still hasn’t been promoted [...] | | By: SEO Authority | | |
| | The LSI Algorithm For Better Search Rankings In Google: | | 2007-11-02 05:48:00 | | The web crawlers are still trying to better their technologies. Human intelligence or a semblance to it is a state they are still aspiring to reach. The human mind, after all, can better recognize the relevancy of the sites spewed out from search engine results than these mechanical crawlers.The latest algorithm applied by Google tries to mimic human sensibilities for this very reason. The Latent Semantic Indexing [LSI] algorithm sieves out websites containing the keyword typed in by a searcher as well as websites having keywords similar to the main search and related phrases.A proper understanding of this concept can be explained by this example. If a web content writer has written an article related to online marketing, then according to traditional SEO conventions, he would repeat the keywords a certain number of times to increase the site ranking in search result pages.If he has peppered his content with variations and similar terms like online marketing strategies, online marketing professionals, online marketing strategies, etc. the LSI algorithm will alleviate the ranking of the site and in the process increase the search engine ranking of the page.The quality of the content should not suffer though when employing such writing techniques. It is important for the writer to preserve the relevancy and quality of the content.The research methods utilized by Clear Media Online are thorough and our team of professional web content writers is constantly keeping themselves attuned to new innovations in the field of SEO.Know our work better, visit us at www.clearmediaonline.com | | By: SEO Beverly Hills | | |
| | Advanced image resize algorithm | | 2007-08-29 12:03:21 | | This innovative resizing technique allows users to “smart” rescale images without the apparence of artefacts. The technique uses smart image recognition and uses algorithms to identify the least important areas of pictures and manipulating them accordingly.
If you can’t see the video click here.
Share This | | By: CrazyLeaf Design Blog | | |
| | | Google's New Algorithm Shake Up | | 2007-05-17 01:51:00 | | Back on April 19th Google announced it would be combining news results into the main body of search results over a few days and I discussed the pros and cons of such an integration. Well that integration did not happen on a wide scale and thanks to Andy Beal I think I know why. It appears Google might have put on the brakes in favor of a larger roll-out of blended results including images, news, video, base, web, etc. all included in the top 10 results!I just came across this important breaking news from Andy Beal regarding Google's "universal search model" which, he announced today, is already rolling out to the masses in a measured manner (see the search for Darth Vader was Andy's example but Luke Skywalker appears to work as well).According to Andy's Google source, Google is upgrading its infrastructure substantially to support this intensive melding of information:"Google is also in the process of deploying a new technical infrastructure that will enable the search engine to han | | By: The SEO Blog | | |
| | Major Updates at Google - New Navigation and Algorithm | | 2007-05-16 23:35:48 | | Google has undergone some major updates and changes today as they released them at the Searchology event.
Google as integrated multiple types of media directly into searches via a nifty navigational bar.
Reports are also saying that YouTube videos are embedded into results as well, but when I tried the example searches, I could not find the embedded video (just a normal link).
Google is also going to start including a navigational bar across all Google properties, so mail, video, and more is only one click away at any given time.
Marketing Pilgrim is also reporting major updates to the Google algorithm. They say that
Google is also in the process of deploying a new technical infrastructure that will enable the search engine to handle the computationally intensive tasks required to produce universal search results. The company is also releasing the first stage of an upgraded ranking mechanism that automatically and objectively compares different types of information. As always, G | | By: Internet Marketing Blog | | |
|
|
| |
 |
|
| |
| |
|
 |
