|
Google Tweaks Its Algorithms For Better Search Results
2011-11-09 06:09:00 News has it that Google is all set to refresh its algorithms so that it shows up the recent search results. Google is now all set to test its new features which will showcase additional search results. This freshness brought in by Google will be built on top of its Caffeine. Google says the search results which will be visible on top of the page will be new and only few minutes old. For example, if you are searching on Lady Gaga, there will be an additional information on the pop star (Wikipedia page, discography, etc) apart from what you are searching for. Google said “sources” will be an experiment as of now (no other details have been revealed). Amit Singhal from Google said, “We are making a significant improvement to our ranking algorithm, which impacts roughly 35 per cent of searches and better determines when to give you more up-to-date relevant results for these varying degrees of freshness“. Almost every year Google makes sure they changes u...
By: WATblog
Algorithms And Data Structures
2011-03-11 22:54:00 Alright, so I've decided that I'll try to start writing up some lessons on Algorithms and Data Structures to help with my studies. Hopefully those of you who are new to programming or would like to learn more about algorithms and performance can learn from these. I'll start by saying that in order to understand what's going on you'll have to have a decent understanding of how to write code (arrays, primitive data types, etc.). Anyway, lets get to business... Now you may be wondering, why should I study algorithms and performance? Well you see, performance is often what draws the line between what is feasible and what is impossible. Algorithms help us understand scalability And Algorithmic mathematics provide us a language for talking about program behavior Now that that little introduction is out of the way... Lets discuss Sorting. What is sorting? Basically you take an input, a sequence of numbers a1,a2,...,an , and output a permutation such that the first number in the ...
By: Helloseo
Google's New Algorithms
2011-03-07 07:20:00 Google's co-founder Larry Page focused on developing the "perfect search engine," an algorithm that would understand what you mean when you are typing a search term and the search engine will give you the exact results that you were looking for. In our last count, we can happily reveal that there were more than 120 different factors that effect the natural rankings by Google's latest algorithm. The latest algorithm was updated to penalise websites that use forums with negative feedback to boost their rankings. Google's New Algorithm 2010 / 2011 Revealed Many SEO Gurus have attempted to give a rough outline of what the Google algorithm might look like. Based on research and suggestions this might be how the formula basically could look like; Google's Score = (Kw Usage Score * 0.3) + (Domain * 0.25) + (PR Score * 0.25) + (Inbound Link Score * 0.25) + (User Data * 0.1) + (Content Quality Score * 0.1) + (Manual Boosts) - (Automated & Manual Penalties) Google's Algorithm E...
By: Helloseo
In the age of informavores, algorithms will replace journalists | Guardian
2009-12-11 21:14:00 Schirrmacher believes we are experiencing a profound change at the moment, an industrialisation of information – an "age of informavores" – and journalism is one of the first fields to undergo the change.
By: Adrian Monck
Colliding Philosophies: Smarter Algorithms Help Find New Particles
2009-03-17 14:31:00 From Scientific American: After a false start in 2008, the Large Hadron Collider (LHC), the glitzy new atom smasher at CERN (the European laboratory for particle physics) near Geneva, is finally due to start its experiments this October. The LHC may or may not end up spewing out da
Algorithms vs. Data: The Seesaw Effect
2008-10-31 03:16:00 Over the years I've noticed that the importance of algorithms and data tends to shift back and forth, depending on which at the time is hardest to duplicate (often from a business perspective). This effect seems to be caused by the availability or demand of one side increasing or decreasing, shifting the balance of importance to the other. At one point the world of software was dominated by the proprietary. The organization with the best software (backend, algorithms, etc) was the dominant entity and data (from say, a Web 2.0 perspective) was generally not the focus. This may have partly been the responsibility of a mindset formed during an era with very little storage space and before mass user activity on the Web. Things have changed and the word proprietary has become a sort-of developer faux pas. Open source has caused a paradigm shift away from the old proprietary software models and has allowed organizations to focus their attention on the other side of the equation: data....
By: Semantic Focus
Reddit, Stumbleupon, Del.icio.us Algorithms Exposed!
2008-07-04 18:42:00 good post from seomoz some highlights: stumble upon Formula: (Initial stumbler audience / # domain) + ((% stumbler audience / # domain) + organic bonus ? nonfriend) ? (% stumbler audience + organic bonus) + N Description: The initial stumbler “power” (Audience of the initial stumbler divided by the amount of times that stumbler has stumbled the given domain) is added ...
By: Blogboing
Distributed Computing: Principles, Algorithms, and Systems
2008-06-08 11:27:00 Designing distributed computing systems is a complex process requiring a solid understanding of the design problems and the theoretical and practical aspects of their solutions. This comprehensive textbook covers the fundamental principles and models underlying the theory, algorithms and systems aspects of distributed computing. Broad and detailed coverage of the theory is balanced with practical systems-related issues such as mutual exclusion, deadlock detection, authentication, and failure recovery. Algorithms are carefully selected, lucidly presented, and described without complex proofs. Simple explanations and illustrations are used to elucidate the algorithms. Important emerging topics such as peer-to-peer networks and network security are also considered. With state-of-the-art algorithms, numerous illustrations, examples and homework problems, this textbook is suitable for advanced undergraduate and graduate students of electrical and computer engineering and computer science...
Google analytics and interactive genetic algorithms
2008-05-20 19:20:00 Xavier Llora made an interesting post about the Google Analytics’ site optimization tool and its close relationship with interactive genetic algorithms. Another related post (also by Xavier) can be found at in IlliGAL Blogging. Check out also the following, related video on YouTube (pointed out by Xavier):
By: MEDAL Blogging
Alexa Changed It's Algorithms
2008-04-18 12:35:00 Starting couple days ago, Alexa changed it's algorithms, making it more accurate it giving traffic rank to almost all web sites in the world. Before changing it's algorithms, Alexa only counted sites traffic juts by Alexa Toolbar installed in visitor's browser and several other methods. read more
Why Search Engine Algorithms are Emphasizing Quality Content
2008-04-08 07:00:00 If you hang around search engine marketers long enough you will hear them whisper about Google, Yahoo or MSN’s algorithms. Algorithms are a fancy way of saying “criteria”. A search engine’s algorithms are the criteria with which it picks, rates and displays search engine results. Those that work daily on ...
By: Resources zone
Everything in the Digg, Reddit & Netscape Algorithms
2008-03-02 20:04:00 At work today, Matt noted that he found Digg's algorithm far more interesting than Google's. I was shocked - after all, Digg isn't nearly as complex or widely used as Google, but with its rising popularity in the tech space, I could, at least, empathize with why he might feel that way. I also took it as a challenge to expose all the possible elements that might be in an algorithm at Digg, Reddit, Netscape, Shoutwire or other social-news-voting sites. Let's see how I do:BTW - I'm going to use a lot of Digg-specific terminology, despite the fact that I'm referring to all of the sites above.1. Number of votes over timeUses a floating target based on relative levels of popularity (as mentioned in timing below)Any number of votes in a very short period (if not manipulative) is stronger than the same number of votes over a longer period.2. Domain of linkHas it previously had content submitted? If so, did that content receive votes, get marked as spam/lame, make the front page, etc?H...
Cyclotimia to launch 'Algorithms' album
2008-01-25 06:00:00 Rage In Eden Records recently announced the upcoming release of Cyclotimia's album, "Algorithms". On "Algorithms", this Moscow duo present a dark ambient sound supported by...
By: Side-Line Music
Algorithms in Bioinformatics
2008-01-21 19:32:00 Algorithms in BioinformaticsThis book constitutes the refereed proceedings of the First International Workshop on Algorithms in Bioinformatics, WABI 2001, held in Aarhus, Denmark, in August 2001. The 23 revised full papers presented were carefully reviewed and selected from more than 50 submissions. Among the issues addressed are exact and approximate algorithms for genomics, sequence analysis, gene and signal recognition, alignment, molecular evolution, structure determination or prediction, gene expression and gene networks, proteomics, functional genomics, and drug design; methodological topics from algorithmics; high-performance approaches to hard computational problems in bioinformatics.DownloadMirror
crunching numbers; or I'm bringing algorithms back
2008-01-16 20:55:00 Turns out, I can type on muscle relaxers. Look at me.I made it through Lexi's first choir rehearsal of the year last night, reading in the senior center foyer while Zack lapped up Ricky Ricotta's Mighty Robot vs. the Uranium Unicorns from Uranius. Thankfully, he hasn't heard any crude jokes about this far away planet, or he wouldn't be able to contain himself.I've been edgy since school began again, displeased with the curriculum in our district. (This is no secret, and while we are visiting my Education Angst, let's all wave at the WASL - the bane of Washington schools.)Now granted, I sound like Mrs. Bluehair, railing against new math like it's the work of the devil, although clearly it leaves my kids possessed. I am willing to believe that they are gaining some deeper thinking skills and boy howdy, my kids are well versed in demonstrating several strategies. But when did I sign up for this: It is the parents' responsibility to teach the times tables and it is up to the par...
By: Mama Milton
Cryptographic Algorithms on Reconfigurable Hardware (Signals and Communicat
2008-01-01 19:23:00 Cryptographic solutions using software methods can be used for those security applications where data traffic is not too large and low encryption rate is tolerable. On the other hand, hardware methods offer high-speed solutions making them highly suitable for applications where data traffic is fast and large data is required to be encrypted in real time. VLSI (also known as ASIC), and FPGAs (Field Programmable Gate Arrays) are two alternatives for implementing cryptographic algorithms in hardware. FPGAs offer several benefits for cryptographic algorithm implementations over VLSI as they offer high flexibility. Due to its reconfigurable property, keys can be changed rapidly. Moreover, basic primitives in most cryptographic algorithms can efficiently be implemented in FPGAs. Since the invention of the Data Encryption Standard (DES), some 40 years ago, a considerable amount of cryptographic algorithm implementation literature has been produced both, for software and hardware platforms....
Microsoft to research advanced algorithms in India
2007-12-20 20:42:00 Microsoft Research in India has formed a group to work on advanced software algorithms, looking for a way to more efficiently process and analyze the large volumes of data generated by Web applications and scientific research.The challenges thrown up b...
Don?t ignore naive or "stupid" algorithms ? hardware is cheap and fast
2007-09-21 00:15:00 I just had a nice reality check. Sort of pleasant in that I realized I could save a LOT of memory usage (like from 35MB down to 9 MB), but also aggravating because I have spent probably 10-20 hours developing a clever algorithm designed for speed. Lesson learned. I should have built the naive version first. ...
Some Operations on Matrix
2007-09-11 14:41:00 A few days back someone asked me a question via email which I thought might be useful to others too. So I’m listing that question along with its answer below. Q. I want to write a program such that users enter the value of matrix and each operation (listed below) is performed by functions. I want to use switch structure to call the functions. 1. Rotate the matrix around the diagonal. Example: 1 2 3 ---> 1 4 7 4 5 6 2 5 8 7 8 9 3 6 9 2. Rotate the matrix around the middle row. Example: 1 2 3 ---> 7 8 9 4 5 6 4 5 6 7 8 9 1 2 3 3. Rotate the matrix around the middle column. Example: 1 2 3 ---> 3 2 1 4 5 6 6 5 4 7 8 9 9 8 7 4. Set the upper triangle to zero. Example: 1 2 3 ---> 1 0 0 4 5 6 4 5 0 7 8 9 7 8 9 Ans. The following program does it. Please note that the matrix is declared as global so as to reduce complications in the program. Better way should have been to pass ...
Amortized Complexity - a Tool for Graph Algorithms (among others) [Good Mat
2007-09-03 22:53:00 There are a lot of very cool problems in computer science that can be solved by using an appropriate data structure; and the data structures are often easiest to describe in terms of graphs. And of those data structures, one thing that often comes up is amortized algorithmic complexity. Amortized complexity is something which has been occupying my thoughts lately, because it’s come up in several real problems, so I’m in the mood to write about it, and it’ll be useful later. The idea of amortized complexity is that for some structures, the worst case complexity cost of a series of operations is different from the worst-case complexity of a single operation. In amortized complexity, you consider cases where some operation is inexpensive most of the time - but to keep it inexpensive most of the time, you need to periodically do something expensive. Read the rest of this post… | Read the comments on this post… Original post by http://feeds.feedburner.c...
low frequency dielectric TDR spectrometer with Cooley-Tukey algorithms
2007-08-19 16:58:00 Low frequencies(1E-4 Hertz to 100 Hertz)are interesting in the study of polymers,both biological such as bones,and plastics,even asphalts for roads....
Secure Encryption will Take More than Better Algorithms
2007-08-09 16:23:00 Realtime Messaging and Web Security – GCN is reporting on the NSA’s move to adopt ECC as a standard for encryption eventually replacing RSA and Diffie-Hellman. The driver is the fear that to keep messages secure for the next 10 to 20 years, we’ll need at least 2,048 bit keys and that is too computationally demanding. ECC provides equally difficult to crack encryption with shorter keys and the algorithm is easier to compute as well. Switching algorithms may be enough for the ... read more
Convex Hull Algorithms Class for Actionscript
2007-07-31 09:59:00 Nice example using the Convex Hull Algoritms by Lost in Actionscript. If you don?t know about... [[ This is a content summary only. Visit my website for full links, other content, and more! ]]
Algorithms
2007-07-29 18:30:00 Algorithms in CBy Robert Sedgewickhttp://rapidshare.com/-files/24950095/aaiicc.rarPasswo-rd:www.AvaxHome.ruProblems on AlgorithmsBy Ian Parberryhttp://mihd.net/309oxaT-he Analysis of AlgorithmsBy Paul Walton Purdomhttp://rapidshare.com/fil-es/5339687/Purdom.djvuAn Introduction to Distributed AlgorithmsBy Valmir C. Barbosahttp://mihd.net/ojflqvMa-stering Algorithms with CBy Kyle Loudonhttp://rapidshare.com/fil-es/10496960/Mastering_Algorithm-s_with_C.rarIntroduction to Algorithms, 2nd EditionBy Thomas H. Cormenhttp://rapidshare.com/fil-es/37085456/MIT.Introduction.To-.Algorithms.2nd.Edition.Incl.Ex-ercises.Edition-DDU.chm.zipAlgo-rithms and Data Structures in C++By Alan Parkerhttp://rapidshare.de/file-s/31417437/Algorithms_and_Data_-Structures_in_C__.rarIntroducti-on to AlgorithmsBy Sanjoy Dasguptahttp://mihd.net/ox5n0mD-ata Structures and Algorithms in JavaBy Peter Drakehttp://www.eazyupload.net/-download/hOsI3gOL/0131469142.zi-p.htm
Evolutionary Algorithms now surpass human designers.
2007-07-26 22:19:00 Charles Darwin has moved to the computer arena. Instead of pitting God against science, the emerging spat centres on evolutionary algorithms (E...
How String Functions (strinh.h) Work?
2007-07-26 15:57:00 In the previous article String Manipulation Functions (string.h), we had a look at some of the commonly used string manipulation functions. There is no denying the fact that those functions are useful but have you ever wondered how those functions actually work or what is the algorithm behind their working? If yes then read on… In this article I am going to present you with our own version of the string manipulation functions that we had discussed, namely strlen(), strcpy(), strcat() and strcmp(). Our versions will do the same thing as done by the original functions but surely they would teach us a lot! Let's have a look at them one-by-one: mystrlen // mystrlen- function #include<iostream.h> int mystrlen(const char *); void main(void) { char ch[]="This is great!"; cout<<"Length:"-<<mystrlen(ch); } int mystrlen(const char *str) { int len=0; while(str[len]!=' ') len++; return l...
Introduction to Linked Lists III
2007-07-23 15:46:00 In the article Introduction to Linked Lists, we introduced the concept of linked list, the example program was programmed to be able to add and display the elements in the linked list. In reality only addition of elements to the linked list is not enough to take the most out of linked list; we should be able to do other operations such as insertion, deletion of elements etc. This article would teach you to do such operation (insertion, addition, deletion etc). The program itself is quite big and has enough comments so I won’t discuss anything here; rather I leave it up to you to understand all the operations yourself! // -- Linked Lists -- // ------------------ // Example program to illustrate // addition, insertion, deletion // and display of nodes in the // linked list #include<iostream.h> // node class, this will // represent the nodes or elements // of the linked list class node { public: int info; node ...
Introduction to Linked Queues
2007-07-23 08:39:00 In one of the article Introduction to Linked Stacks, I said that representing data structures such as Stacks and Queues as arrays had one major problem that it can?t have more than a predefined number of elements. To overcome this we used linked lists to represent stacks. In this article we?ll use linked lists to represent queues. Below are some graphics that illustrate the addition and retrieval of elements to and from the linked queue. FIG.: Addition of data to the linked queue FIG.: Retrieval of elements from the linked queue I don?t think there is anything more that needs to be discussed, so let?s have a look at the example program: // -- Linked Queues -- // C++ Example Program to // illustrate the representation // of queues as linked lists #include<iostream.h> // node class, this will // represent the nodes or elements // of the linked queues class node { public: int info; node *link; }; // declare global objects node *f...
Introduction to Linked Stacks
2007-07-20 08:47:00 In the article Data Structures: Introduction to Stacks, we saw that there was one major disadvantage of representing stacks using arrays- the stack like the array could have a limited number of elements, while stacks should be able to grow up to any number of elements. Besides this there were other disadvantages too. In one of the other article about Linked Lists, we noticed one useful property of linked lists that they can grow up to any size to accommodate for the addition of elements and it efficiently uses the memory too. So if we combine both of this to from a linked version of the stack then it won’t have the shortcomings that the array version had. This is what this article is all about. pushing and popping As you know that addition of elements to the stack is known as pushing while retrieval is known as popping. The process of pushing and popping in case of linked version of stack is slightly different from the array version. The followin...
Introduction to Basic Encryption and Decryption
2007-07-18 08:34:00 Encryption is a familiar sounding word which means to convert readable data in such a form that it becomes un-understandable or un-meaningful. It is employed almost everywhere where any confidential data is needed to be kept or transferred. Encryption goes hand in hand with decryption which means to convert un-meaningful encrypted data to its original meaningful form. Here in this article we are going to design two functions, one for encryption and other for decryption, to illustrate the basic concept of encryption and decryption. Please note that the example program provided in this article is for illustrative purpose only, there are a few limitations in the program which limits its practical use. How encryption and decryption works? The main concept behind encryption is to convert the readable data into something which looks un-meaningful to us. It could be achieved in various ways but the simplest one is to change the ASCII code of the data. Ex. #incl...
Changing the case (lower, upper) of Strings
2007-07-17 14:25:00 In this article, we will be designing two functions to change the case of strings. One would change a string from lower case to upper case while the other would do the opposite. Although we have pre-defined functions for doing this in a header file, but this article is for those who dare to know how all these operations are done internally. Changing the case: How is it done? The main theory lies in the way C++ treats character constants and strings. Have a look at the following code: #include<iostream.h> void main(void) { char first='A'; char second=65; cout<<first; cout<<endl; cout<<second; cout<<endl; } whose output is: A A Press any key to continue This is because ?A? and its ASCII code 65 are equivalent to the compiler and in c++ we can manipulate it in whatever way we like. Now look at the following code: #include<iostream.h> void main(void) { char arr[4]="ABC"; char arr2[4]={65,66,67}; ...
Introduction to Linked Lists Part II
2007-07-16 09:02:00 In the previous article Introduction to Linked Lists, we introduced the basic concept of linked list. To make the program (an the article) as simple as possible, we discussed only the addition and display of nodes in the linked list although necessary we didn't’t discussed the deletion of node in that article. In this article we will be discussing about the deletion of nodes from linked lists. Deletion of node (elements) from a linked list The node to be deleted can be represented by many ways but here we will be representing it by its info. So if we have the following linked list And we want to delete node1 then we will express it by its info part (i.e. 10). The main theory behind deletion of nodes is pretty simple. We need to make the link pointer of the node before the target node (to be deleted) to point at the node after the target node. Suppose if we wish to delete node having info as 10 from the above linked list then it will be accompl...
Introduction to Linked Lists
2007-07-15 08:49:00 We have been using arrays to store similar data linearly. While arrays are simple to understand and easy to implement in common situations, they do suffer from some drawbacks which are listed below: Arrays have fixed dimensions, even if we dynamically allocate the dimension it remains constant throughout. So there is a limit to the number of elements it can store. Operations such as insertion and deletion are pretty much difficult to implement and increases the overhead because these operations require elements in the array to be physically shifted. Linked lists overcome these drawbacks and are commonly used to store linear data. Actually elements of linked lists (called as nodes) store two information, data and the link (pointer) pointing to the next elements (node). The elements (nodes) are linked sequentially with the help of link pointers. So we can say that linked lists are collection of nodes which have data and ...
Data Structures: Introduction to Queues
2007-07-04 15:43:00 Queue is a linear data structure in which data can be added to one end and retrieved from the other. Just like the queue of the real world, the data that goes first into the queue is the first one to be retrieved. That is why queues are sometimes called as First-In-First-Out data structure. In case of queues, we saw that data is inserted both from one end but in case of Queues; data is added to one end (known as REAR) and retrieved from the other end (known as FRONT). The data first added is the first one to be retrieved while in case of queues the data last added is the first one to be retrieved. A few points regarding Queues: Queues: It is a linear data structure; linked lists and arrays can represent it. Although representing queues with arrays have its shortcomings but due to simplicity, we will be representing queues with arrays in this article. Rear: A variable stores the index number in the array at which the new data will be added (in the queue). Front: It is a variab...
Insertion and Deletion of elements in a Sorted Array
2007-07-01 08:37:00 In the article Insertion and Deletion of elements in an Array, we saw how data is inserted and deleted in an unsorted array. In that case, we needed two information, the element as well as the position, for insertion while for deletion we needed the position. In the case of sorted arrays insertion and deletion takes pace in a slightly different way. The following example will clarify this: Suppose we have the following array: arr[5]={1,2,3,4,5} And, we need to insert the element 6, so where it should be inserted? We can?t insert it at any place because then the array might not remain sorted. Therefore, we let the program to automatically calculate the position suitable for the new element, so that the array remains sorted even after insertion. Now, arr[5]={1,2,3,4,6} Now, suppose we wish to delete the element 6, in this case we don?t use the position for deletion because we don?t know where the element was placed by the program, so rather than referencing the position for deletion, ...
Data Structures: Introduction to Stacks
2007-06-30 15:30:00 In the previous article, we saw how data is inserted and deleted in an array. In that case we could insert data at any place throughout the array. However, there are situations when we only need to add and retrieve data form the ends of the array. Stacks are one of the examples of this. Stacks are data structures in which data could be added and retrieved only from one end (also known as the TOP of the stack). Suppose we insert 5, 6, 9 to the stack consecutively then while retrieving the first one to be retrieved will be 9 then 6 and then 5. That is why stacks are also known as Last-In-First-Out (or LIFO) structure. A few terms regarding stacks: Stack: Stack is a user-defined data structure. It is most commonly represented by linked-lists and arrays. In this article, we will be representing stacks with arrays. Push: Adding data to the stack is known as pushing. Pop: Retrieving data from the stack is known as popping. Let us have look at this process with the help of an examp...
Insertion and Deletion of elements in an Array
2007-06-30 07:57:00 Suppose you are storing temperature data for a few months and you forgot to store the temperature of a particular day (say 5th day) then you need to INSERT that temperature after the 4th element of the array and in the other case if you accidentally stored duplicate data then you need to DELETE the duplicate element. Apart from these simple examples, there are many other uses of insertion and deletion The array to which the element is to be inserted or deleted can be of two types unordered (unsorted) and ordered (sorted). Here we will be discussing about the insertion and deletion of element in an unordered or unsorted array. For insertion in these types of arrays, we need to have two information, the element to be inserted and the position to which it will be inserted. For deletion, we only need the position. Suppose we have the following array: arr[5]={5,7,2,1,3} And we need to insert the element 6 at the 2nd position, after insertion: arr[5]={5,6,7,2,1} Notice how the last elemen...
Algebra of Matrices (2D Arrays) Part II
2007-06-29 11:58:00 As you know from the previous article, matrices are 2D arrays. In the previous article, we saw how two matrices are added and subtracted. In this article, we will continue our discussion on algebra of two matrices by discussing how two matrices are multiplied. Multiplication of two Matrices Multiplication of two matrices mat1[a x b] and mat2[p x q] is only valid if b=p. While there are many algorithms by which two matrices can be multiplied, here I?ll give you the most simple algorithm. Others are used when efficiency matters. Algorithm for Multiplication of two Matrices Suppose, Two 2D arrays to be mat1 [p][p] and mat2 [p][p] having same number of rows and columns. A third 2D array, mul [p][p] to store the result. Here is the algorithm: FOR I = 0 TO (p-1) FOR J = 0 TO (p-1) mul [I][J] = 0 FOR K = 0 TO (p-1) mul [I][J] += (mat1 [I][K] * mat2 [K][J]) END OF INNER LOOP END OF OUTER LOOP Below is a example program which illustrates the multiplication of two ma...
Graph Coloring Algorithms [Good Math, Bad Math]
2007-06-28 21:59:00 Graph coloring is deceptively simple. The idea of coloring a graph is very straightforward, and it seems as if it should be relatively straightforward to find a coloring. It turns out to not be - in fact, it’s extremely difficult. A simple algorithm for graph coloring is easy to describe, but potentially extremely expensive to run. Read the rest of this post… | Read the comments on this post… Original post by http://feeds.feedburner.com/~r/-ScienceblogsCombinedFeed/~3/128-819070/graph_coloring_algorithm-s_1.php
Algebra of Matrices (2D Arrays)
2007-06-26 07:58:00 In the programming sense, Matrices are Two Dimensional or 2D arrays. Just as Matrices have rows and columns, similarly 2D arrays too have rows and columns. There are many mathematical operations like addition, subtraction, multiplication etc. which can be performed on matrices, and therefore to 2D arrays also. In this article, we will be discussing about the addition and subtraction of two 2D arrays (Matrices). Addition of two Matrices (2D arrays) For addition of two matrices both the matrices must have the same dimension. Ex. if matrice one has the dimension p x q then matrice two must have the dimension p x q. In the addition process, each of the element of the first matrice is added to the corresponding element of the second matrice and result is stored in the third matrice having the same dimension (i.e. p x q). Below is the algorithm for adding two matrices. Algorithm for adding two Matrices Suppose, Two 2D arrays to be mat1 [p][q] and mat2 [p][q] having p rows and q columns...
Binary Search: A Method of Searching
2007-06-25 12:41:00 Binary Search method is popular for searching a specific item in an ordered array (sorted). It can perform the search in minimum possible comparisons, but it needs the array to be sorted in any order. Practically, it is used when the data is itself sorted initially or needs to be sorted for other activities also. This is because you don?t want to first sort the data and then use binary search, in that case use of linear search would be practical. Binary Search Algorithm Suppose, The array to be AR[SIZE] having SIZE number of elements. L is the index number of the lower element. We take it to be 0. U is the index number of the upper (last) element. It will be (SIZE-1). ITEM is the data that needs to be searched. beg, last and mid are variables of type int(eger). Here is the algorithm: LET beg = L AND last = U REPEAT STEPS 3 THROUGH 6 TILL beg<=last mid = ( (beg+last)/2) IF AR[mid] = ITEM THEN ITEM IS AT POSITION mid BREAK THE LOOP IF AR[mid] <...
Sorting an Array using Bubble Sort
2007-06-25 12:39:00 In this article we will see how an array can be sorted using Bubble Sort Technique. Sorting, as you know, is the method of arranging the elements of an array in an order (ascending or descending). The basic idea behind bubble sort method of sorting is to keep on comparing adjoining elements of the array from the first until the last and interchanging them if they are not in proper order. The whole sequence is repeated several times when the array becomes sorted. Bubble Sort Algorithm Suppose, The array (to be sorted) to be AR[SIZE] having SIZE number of elements. L is the index number of the lower element. We take it to be 0, since the whole array has to be sorted. U is the index number of the upper (last) element. It will be (SIZE-1). Here is the algorithm of sorting the array using bubble sort FOR I = L TO U FOR J = L TO (U-1) IF AR[J] > AR[JA1] THEN temp = AR[J] AR[J] = AR[J+1] END OF INNER LOOP END OF OUTER LOOP Now that you know the algorith...
A Multi-Purpose String Class in C++
2007-06-22 09:27:00 NOTE: Here I present you with a String Class in C++. We have pre-defined string class (CString in Microsoft Visual C++) which has similar but more powerful to the one presented here but using something is one thing and learning how it works is another. Here I show you how string functions actually work. All the functions are programmed from the scratch without using any other standard library function. Look at the program (Class) carefully and try to understand how each of the function is working. //------------------------------ //-----------myClass------------ //----A String Class in C++---- #include<iostream.h> #include<stdlib.h> class myString { private: // these functions are not // needed outside the class void allocate(int); void copy(char *, char *); public: char *string; // member functions myString(); myString(char *); int getLength(); int getLength(char *); void empty(); bool isEmpty(); void putStr...
Algorithms in Java, Third Edition (Parts 1-4)
2007-05-13 05:22:00 Publisher: Addison-Wesley Professional; 3 edition Language: English ISBN: 0201361205 Paperback: 768 pages Data: July 23, 2002 Format: CHM Description: This edition of Robert Sedgewick’s popular work provides current and comprehensive coverage of important algorithms for Java programmers. Michael Schidlowsky and Sedgewick have developed new Java implementations that both express the methods in a concise and direct manner and provide programmers with ...
By: Ebooks Corner
Various Sorting Algorithms Shown Visually
2007-04-30 23:18:00 There are lots of sorting algorithms out there and sometimes it gets confusing as to which is which. Analyzing pseudo code sometimes can get monotonous, especially if it’s Monday. That’s why I find this little applet useful. It shows six different algorithms visually as they sort the same data. You can also randomize the input data or sort a pre-sorted list to view how each algorithm behaves in each case. It’s a very handy tool for those who are starting to learn the ropes. Sorting Algorithms Demo Tags: computer science, sorting algorithms, algorithms
New book on parameter setting in evolutionary algorithms
2007-04-25 22:47:00 Just a while ago I checked my mail and found a copy of a new book Parameter Setting in Evolutionary Algorithms edited by Fernando Lobo, Claudio F. Lima, and Zbigniew Michalewicz. The book looks great and I think that everyone who works in evolutionary computation should read it. Here’s short info on the book from ...
By: MEDAL Blogging
Next Generation NIST Algorithms
2007-02-23 06:34:03 The National Institute of Standards and Technology (NIST) has called for a competition to develop new hash algorithms, the foundation for much of the security that protects the Internet, which makes these heady times for cryptanalysts. That might not mean much to most people who use the Internet, since they never come in touch with these algorithms. It also won?t mean much to the bad guys who design the malware that plagues a lot of those users, as breaking the algorithms themselves is beyond the ken of most of them. But for the people who design the security products that users do depend on, and that attackers try to circumvent, it?s a once in a decade chance to craft a better and stronger foundation for the future. The definitions of the current hash algorithms were established around 20 years ago, said Burt Kaliski, chief scientists at RSA Laboratories, the research arm of RSA Security Inc., and those algorithms were first used for a limited number of things such as digital sign...
Detection Algorithms to Enable Sign Language On-the-Go
2007-02-16 00:45:03 From Engadget: Designed to assist the mute and deaf who rely on cellphones, the MobileASL video compression project seeks to ena...
Search Engine Algorithms
2007-02-01 21:32:00 Here is some important info you will need to understand how search engines function so you could optimize your site to their standards: HOW DO SEARCH ENGINES FUNCTION? A search engine's main job is to provide results that most satisfy user's query. If they present a result that the user visits and doesn't agree that the document is about their query, there is a very good chance that the user may not use that search engine again.Most search engines pay no attention at all to the Meta description tags. Meta description and keyword tags are hidden attributes that you can add to the front of your document which are supposed to describe the document. Since the users will never see this information, they will be disappointed if you stick in invalid keywords or fail to keep the description in line with the document's contents that usually is the case.Most Search Engine Algorithms rank pages based on the following aspects: Content of the website Representation of content, ke...
Data Structure and Algorithms Ebook and Tutorial
2007-01-19 20:09:00 Here are links for Data Structure and Algorithms ebook and tutorial resources with which you can learn how to create data structure using various algorithms and techniques.Algorithmic Information Theory By G J Chaitin Algorithms and Complexity by Herbert S. Wilf Algorithms and Data Structures in VLSI Design By Christoph Meinel and Thorsten Theobald Algorithms by S. Dasgupta, C.H. Papadimitriou, and U.V. Vazirani Algorithms for Modular Elliptic Curves By J. E. Cremona Algorithms for programmers By Jorg Arndt Art of Programming Contest - C Programming Tutorials Data Structures Algorithms Average Case Analysis of Algorithms on Sequences by Wojciech Szpankowski Combinatorial Algorithms By Jeff Erickson Data Structure in Java By Sandra Andersen Data Structures And Algorithms - CSEd Tools Data Structures and Algorithms By Alison Cawsey Data Structures and Algorithms By John Morris Data Structures and Algorithms in C++ By Michael T. Goodrich, Roberto Tamassia and David M. Mount Data Struct...
By: Ebook Home
|
|
 |
|
 |
