Algorithm Geeks Google Group

Call for Papers: The 2010 International Conference on Frontiers in Education: Computer Science and Computer Engineering (FECS'10), USA, July 2010

amgs...@yahoo.com (A. M. G. Solo) — Tue, 15 Dec 2009 15:43:49 UT

It would be greatly appreciated if this announcement could be shared
with educators whose interests include computer science, computer
engineering, and applied computing. Thanks.
-------
CALL FOR PAPERS
and
Call For Workshop/Session Proposals

Re: [algogeeks] A MS QUESTION

rmath...@gmail.com (Roshan Mathews) — Tue, 15 Dec 2009 12:19:21 UT

[link]

Re: [algogeeks] A MS QUESTION

aryansmit3...@gmail.com (sharad kumar) — Tue, 15 Dec 2009 11:33:10 UT

can u make use of binary index trees

Re: [algogeeks] A MS QUESTION

abhijith200...@gmail.com (abhijith reddy) — Tue, 15 Dec 2009 10:53:15 UT

*TRIE*: Using a trie we would get a linear time solution but i think the
memory requirement would be huge ..

Invitation to connect on LinkedIn

s.vivek.ra...@gmail.com (Vivek Sundararajan) — Mon, 14 Dec 2009 18:16:20 UT

LinkedIn
------------

Vivek Sundararajan requested to add you as a connection on LinkedIn:
------------------------------ ------------

Phani,

I'd like to add you to my professional network on LinkedIn.

- Vivek

Accept invitation from Vivek Sundararajan
[link]

A MS QUESTION

mehta...@gmail.com (vicky) — Mon, 14 Dec 2009 17:32:03 UT

Given a file with a lot of words (10 million) find out the top 10%
most
frequently occuring words.

Re: [algogeeks] Difference between Dijkstra's algorithm and Bellman-Ford's algorithm?

linus.prob...@gmail.com (Linus Probert) — Mon, 14 Dec 2009 09:02:00 UT

There are some time differences and all, the vital part is that
bellman-ford handles negative weights on the edges in the graph,
Dijkstras does not.

Besides that there is some time difference and so forth.
Bellman-ford: O(V|E|)
Dijkstra: O(v�) ? (give or take depending on the heap or priority queue

Re: [algogeeks] Difference between Dijkstra's algorithm and Bellman-Ford's algorithm?

114piy...@gmail.com (Piyush Verma) — Mon, 14 Dec 2009 08:59:46 UT

bellman-ford's algo works on graph having -ve edge cycle, but
dijkstra algo would not work on that type of graph, it is implemented on the
graph of +ve edges.

Re: Difference between Dijkstra's algorithm and Bellman-Ford's algorithm?

linus.prob...@gmail.com (LiquidityC) — Mon, 14 Dec 2009 10:50:09 UT

Alot of descriptions and stuff popped up there :-)

All you want to keep in mind is that Dijkstra is quicker but does not
handle negative weighted edges in the graph since it can't handle
negative cycles.
Bellman-Ford handles this at the cost of being a bit slower.

Re: [algogeeks] Difference between Dijkstra's algorithm and Bellman-Ford's algorithm?

rohit.kumar.sa...@gmail.com (Rohit Saraf) — Mon, 14 Dec 2009 09:31:07 UT

to allow negative weights

Re: [algogeeks] Difference between Dijkstra's algorithm and Bellman-Ford's algorithm?

rohit.kumar.sa...@gmail.com (Rohit Saraf) — Mon, 14 Dec 2009 09:30:39 UT

Algorithm

Bellman-Ford is in its basic structure very similar to Dijkstra's
algorithm<[link]>,
but instead of greedily selecting the minimum-weight node not yet processed
to relax, it simply relaxes *all* the edges, and does this |*V*| - 1 times,
where |*V*| is the number of vertices in the graph. The repetitions allow

Difference between Dijkstra's algorithm and Bellman-Ford's algorithm?

mehta...@gmail.com (vicky) — Mon, 14 Dec 2009 06:10:09 UT

What is the difference between Dijkstra's algorithm and Bellman-Ford's
algorithm?

Call for Papers: The 2010 International Conference on e-Learning, e-Business, Enterprise Information Systems, and e-Government (EEE'10), USA, July 2010

amgs...@yahoo.com (A. M. G. Solo) — Sat, 12 Dec 2009 17:05:43 UT

It would be greatly appreciated if this announcement could be
shared with individuals whose research interests include
e-learning, e-business, enterprise information systems, and
e-government. Thanks.
-------
CALL FOR PAPERS
and
Call For Workshop/Session Proposals

Typesetting.

linus.prob...@gmail.com (Linus Probert) — Sat, 12 Dec 2009 14:10:21 UT

Heres a nice little problem that has been keeping me up for days.

We have a set of n words (where a word is anything between two spaces).
Our printer only allows M characters per line included the spaces
between the lines.
We want to provide the optimal way of outputting our text with an even

Re: parallel algorithm: find majority element

sumr...@gmail.com (Geoffrey Summerhayes) — Fri, 11 Dec 2009 17:32:15 UT

Couldn't you just use each processor x
to compare A[x] with A[mod N x+2^step]
step=0 to ceiling[ln N]-1
and replace A[x] with the max?

If I've got it right (untested), with each step the
number of times the maximum value appears
doubles until it takes up the entire array.

--
Geoff