1234

2134

2143 ... n so on.

can any please tell me how do i proceed ? i have devised an algorithm myself, which swaps consecutive numbers... but it works only for 3 digit numbers. but the above mentioned problem needs to work for all numbers.

plzzz help ...

"[b]The[blue] GEEK[/blue] Shall Inherit The Earth" ;-) [/b]]]>

This is what I have:

Var x;

Function equate( list m)

// if list size is 0 empty or 1 print computation can not be done

If(length m >=1)

Divide the lists into two parts

Var list left ,right ;

Var int middle = length (m) /2;

For each x in before middle

Add x to the left // left is an array

Loop : For (int i=0;i< middle;i++ )

For (int j= 1;j<middle;j++)

multiply left (i)xleft(j)

if (left (i)xleft(j) =x )

print left (i) , left(j)

For each x in after middle before length(m) // right is an array

Add x to the right

Loop : For (int i=middle ; i< m ;i++ )

For (int j= middle ;j<m ;j++)

multiply right (i)x right (j)

if (right (i)xright (j) =x )

print right (i), right j

Is this correct. Please, do not make it complicated. I want to keep it simple. If it is correct or I have to change something please tell me the line, and what it should look like, write the line out! Thank you!

]]>

Rank racon - the best search marketing secret formula for ranking your website in Google. Check it to find out more ]]>

I write QR decoder.

If I get distortion QR image,

decoder cannot recognize it.

For example, if I make QR photo angularly.

How can I adjust QR image?

]]>

My answer:

Var x;

Function equate(list m)

If(length.m >=1)

Var l.list, r.list;

Var int middle = length.m /2;

For(int i = 0; i < middle; i++)

For(int j = 1;j < middle; j++)

l.list(i)*l.list(j)

if(l.list(i)*l.list(j) =x)

print l.list(i), l.list(j)

For(int i = middle; i < m; i++)

For(int j = middle; j < m; j++)

r.list(i)*r.list(j)

if(r.list(i)*r.list(j) = x)

print r.list(i),r.list(j)

I want to make sure if this is correct! If I have to change something please show me on my code what I have to change, and explain! Thanks!

]]>

Each group can also have n numbers of students.

Example:5 groups

group 1(math) : student a ,b,c,d ,e

group 2(english): student b,c,f,g

group 3(biology): h,i,g,k,s,m,n,o,p

group 4(chemistry): a,f,,n,z

group 5(computing):b,q,y,w

Result: i could create an algorithm that selects the first element of every group so all groups are covered however that isnt efficient

a good efficient minimum would be: b, n

where do I start? what data structures can i use to make it efficient?]]>

Each group can also have n numbers of students.

Example:5 groups

group 1(math) : student a ,b,c,d ,e

group 2(english): student b,c,f,g

group 3(biology): h,i,g,k,s,m,n,o,p

group 4(chemistry): a,f,,n,z

group 5(computing):b,q,y,w

Result: i could create an algorithm that selects the first element of every group so all groups are covered however that isnt efficient

a good efficient minimum would be: b, n

where do I start? what data structures can i use to make it efficient?

]]>

In the prospect of render a database anonym I need to generate certain ranges of data.

I have what I need for the USA.

http://www.highprogrammer.com/alan/numbers/dl_us_shared.html

Now I need something similar for a maximum of European countries.

If you already had to do something similar, any algos or tips for any countries is welcome.]]>

[[1, "a"], [2, "b"], [1, "c"]]

print:

1, "a"

1, "c"

Thanks a lot,

C

]]>

[[1, "a"], [2, "b"], [1, "c"]]

print:

1, "a"

1, "c"

Thanks a lot,

C

]]>

But, few recent software try to transcribe voice from multiple speaker to text, some with few hours of "calculation", other in real time.

What kind of algorithm can they use to transcribe more than 1 voice ?

Can you tell me some name of different projects about multiple speaker recognition software / algorithms ?

]]>

This is what I have so far, but I have no idea if I am even correct:

Finding the minimum key stored in a B-tree is quite simple, we just do the opposite of find the maximum and that would be by finding the left most leaf / subtree for the given root. Once, we find the left most leaf / subtree of the give root the smallest element in the node would be the minimum key.

Finding the predecessor first we would have to find the maximum

]]>

]]>

]]>

Any help would be appreciated.

]]>

Any help would be appreciated.

]]>

I am trying to build an artificial neural network.

So far my network is divided into several layers, all of which comprising a certain amount of neurons. Every neuron is connected to every other neuron in the previous and following layer. Neurons receive an input from all their connections. These inputs have been multiplied by a value which is the "weight" of the connection between the two. All inputs are summed and the output of the neuron is the result of a sigmoid function which takes the sum of inputs as a parameter. Overall, the network produces a result R. The "error" of the network is given by E = 1/2*(O-D)^2 where D is the desired result. At this point, having:

a) The individual output of all neurons stored within the neuron objects

b) The overall error of the network

How should I modify the weight of the connections between neurons?

Cheers :)

Dario

]]>

I am trying to build an artificial neural network.

So far my network is divided into several layers, all of which comprising a certain amount of neurons. Every neuron is connected to every other neuron in the previous and following layer. Neurons receive an input from all their connections. These inputs have been multiplied by a value which is the "weight" of the connection between the two. All inputs are summed and the output of the neuron is the result of a sigmoid function which takes the sum of inputs as a parameter. Overall, the network produces a result R. The "error" of the network is given by E = 1/2*(O-D)^2 where D is the desired result. At this point, having:

a) The individual output of all neurons stored within the neuron objects

b) The overall error of the network

How should I modify the weight of the connections between neurons?

Cheers :)

Dario

]]>

Please i need some learning materials, please

]]>

CLRS 30.1-3

You can find the problem in this list (not my list assignment), as problem 5 http://clweb.csa.iisc.ernet.in/meghana/courses/daa/as3.pdf

Solution may involve complex roots of a unitary circle. For those of you who dont know a point-value representation of a polinomial is simply representing a polinomial o degree n by n points in the cartesian space.

Thanks in advance.

]]>

CLRS 30.1-3

You can find the problem in this list (not my list assignment), as problem 5 http://clweb.csa.iisc.ernet.in/meghana/courses/daa/as3.pdf

Solution may involve complex roots of a unitary circle. For those of you who dont know a point-value representation of a polinomial is simply representing a polinomial o degree n by n points in the cartesian space.

Thanks in advance.

]]>