Algorithms / Advanced Math Forum

Hi, I try to understand galil-giancarlo algorythm but there is no any explanatory resources. I dont understand how to fill h and shift table. Filling tables is the preprocessing of the algorythm ifI understand the table filling I understand all algorythm, if you understand this algorithm please help. Best regards..

Any pointers to algorithms to find "Fundamental Cutsets of a graph or a tree"

Hi, I am trying to find the formula for a sine curve that passes through three known points with the lowest amplitude. Would anyone be able to provide some guidance regarding the best method of figuring this out? Thanks in advance.

Hi, I have a problem to solve, and do not see any optimal solution :/ The problem is: I have n workers and k jobs. Each job is to be done by specified number of workers, and each worker has his level of happines for each job. I have to to make a work schedule so that workers would be as happy as possible. So, I have array a1 of int. k-th...

In CLRS(Cormen Rivest) 3e,while reading Chap-23,page-626,Th-23.1,I can't understand the last part of the proof in page-627."It remains to show....is safe for A." . the line that creates problem is "We have A <= T',since A<= (subset of)T and (x,y)belongs to A. thus ..".We have started with A <= T(some mst) now how come we can say A<= T'. The whole...

Hello friends, I am just new to relational algebra probably a pre-step before learning SQL queries. Can you help me make the expressions of relational algebra expression for each of the following queries. These are the tables contained inside a bus driver database. • driver( driver_id, driver_name, age, rating ); • bus( bus_id, bus_name,...

I have been doing this a very short time im writing a program in Raptor. Add up 5 grocery items subtotal add tax of 0.06 or 6% of subtotal and add th tax to the subtotal. I got as far as the subtotal and can not get the right technique to calculate the rest . this assignments due by midnight I just need some hints please

This is an eclipse based project. So the attachment may be unzipped and run in eclipse. eclipse Juno and Java 7 has been used. First the code should be inspected and run. Then the blog may be reffered. ====================================== Stack based implementation of Binary Tree traversal. The ArrayList<Integer> result variable will have...

Let x,y be finite real valued sequences defined on 0...N-1 and let g be a non negative integer . define z (formula is in this link): http://oi59.tinypic.com/16jn907.jpg also on 0..N-1. In addition, the DFT of y is known in a closed form. Is there a way to write z as some cyclic convolution, so that with the help of the convolution theorem...

I'm looking for an algorithm to find the smallest ellipse circumscribed around any polygon. It doesn't matter if the polygon is convex or concave, or how many corners it has. What counts is that it's a set of points (extremes) and its surface is continuous. Imagine a city of an irregular shape that we want to surround with the smallest ellipse...

An array of n employee names NAME and a corresponding array of n employee salaries SAL.Assume that a personn in Name earns SAl.The entries are sorted by name,not salary. Given an employee name,determine how many employee make more than that person.

Given a point at some location, and an angle with witch to rotate the point by, how would this be done mathematically? So, for example, my point is at 4,8,10 and I want to rotate it 28 degrees clockwise, how would this be done? Any ideas and info is appreciated. Thanks, CodeNoob117

Hello, I have the following code ( generated by IDA ) void MakeKeyData(char *lpszKeyString) { md5 = EVP_md5(); EVP_Digest(lpszKeyString, strlen(lpszKeyString), pKeyData, 0, md5, 0); RC4_set_key(&RC4Key, 16, pKeyData); }

The scenario: An object rotated 30 degrees right and 10 degrees up wants to move forward on its x,y,z plane, which is offset from the standard plane because of its rotation. Given a 3D Environment which has a standard x, y, z plane, and a separate object whose degree of rotation from the standard plane is known along with its x, y, z...

I am an experimental research engineer working on a Laser experiment. The details do not matter but due to practical limitations my data is influenced by the following transformation during data acquisition, and I was wondering if there is a mathematical method or an algorithm to "undo" its effect on the captured signal, that is to get the...

Hi, I have generated a quadtree algorithm to trace singularity curves of a parallel manipulator having known the singularity functions already in C++.Now that I have got the curves,how do I check the correctness of the curves as in something like RMS value.I am asking this because the function returns both real and complex values and I am not...

as we know that duplicates nodes are accepted in heap tree. but i want to know the reason that why it is only done in heap tree? not other tree?why in heap tree

Hello, Thank you for helping me with this. I need to design an algorithm for the following. From the table below, I want to find out a set of 7 names that gives the largest sum of marks possible with keeping the total fees less than 4000. Just to be clear, here is the problem in different words. Desired output: Set of 7 names...

Hi, I have to solve the following problem: given a set of n points, an integer d and a mxm 2D grid, find whether it is possible to place a point P such that the (Manhattan) distance between P and each point of the set is inferior to d. Doing a DFS from each point, I think it is possible to solve it in O(nm²), but I'm asking myself how to do...

What is the expected number of coin flips for getting a head?

I want to write a pseudo code for calculating standard deviations using several functions like calculating mean and the sum of difference squared. how can i do it

Hi, I'm really stuck with this analyse of amortize cost exercise : --------------- Show how to implement a queue with two stacks such that both Enqueue and Dequeue takes amortized time O(1) Can you help me please?

Hello everyone. I am new here and I am sorry if a topic like this has already been posted, but I am taking a graduate level course in Design and Analysis of Algorithms this semester and I pulled a real hard ass of a professor, the kind you pray you don’t get for a class like Algorithms but which if you are unlucky enough to get it will be in just...

Last time I gave the mathematical reasoning to prove Dijkstra's algorithm. This time I am giving a possible implementation for Kosaraju's algorithm which finds the strongly connected components in a directed graph. Short form of "strongly connected components" is SCC The intent of the program. ========================== The program finds...

Claim: There may be only one sorted alignment in decreasing/increasing order such as X1, X2, X3,...... when X1, X2, X3 are distinct numbers PROOF IS DONE FOR DECREASING ORDER ONLY. SIMILARLY IT MAY BE PROVEN FOR INCREASING ORDER Proof: X1, X2, X3,...... is decreasing. We call this as order 1