|
|
|
|
Charles E. Leiserson
Charles E. Leiserson Charles Leiserson is a computer scientist, specializing in ...
http://en.wikipedia.org/wiki/Charles_E._Leiserson - 3k - Cached - Similar pages
|
List of political scientists
... work of many early political scientists, including Charles Dodgson. Jean-Charles de Borda - 18th century mathematician who devised ... University Press) Larry Diamond - Comparative democratization specialist Charles Lutwidge Dodgson (a.k.a. Lewis Carroll ... Doyle - International relations theorist, author of "Empires". E David Easton - Originator of systemic theory Harry ... Political theorist, specializing in patriotism, American literature. E.E. Schattschneider - Early political parties expert, ...
http://en.wikipedia.org/wiki/List_of_political_scientists - 36k - Cached - Similar pages
|
Discrete Fourier transform
... X_k = \sum_{n=0}^{N-1} x_n e^{-\frac{2 \pi i}{N} k n ... k = 0, \dots, N-1 where e is the base of the natural logarithm ... N} \sum_{k=0}^{N-1} X_k e^{\frac{2\pi i}{N} k n ... math>\sum_{n=0}^{N-1} \left(e^{ \frac{2\pi i}{N} kn}\right) \left(e^{-\frac{2\pi i}{N} k' ...
http://en.wikipedia.org/wiki/Discrete_Fourier_transform - 54k - Cached - Similar pages
|
RSA
... q-1) \,. Choose an integer such that which is coprime to ... math>d such that . the ... frac{x(p-1)(q-1)+1}{e} to be an integer, then using ... key consists of n, the modulus, and e, the public exponent (sometimes encryption exponent). ...
http://en.wikipedia.org/wiki/RSA - 38k - Cached - Similar pages
|
List of publications in computer science
... to Automata Theory, Languages, and Computation John E. Hopcroft Jeffrey D. Ullman Addison-Wesley, 1979 ... combinatorial problems R. M. Karp In R. E. Miller and J. W. Thatcher, editors, Complexity ... Interactive Proof Systems Shafi Goldwasser, Silvio Micali, Charles Rackoff SIAM Journal of Computing , 18(1 ... Influence Introduction to Algorithms Thomas H. Cormen Charles E. Leiserson Ronald L. Rivest Clifford Stein ...
http://en.wikipedia.org/wiki/List_of_publications_in_computer_science - 53k - Cached - Similar pages
|
Prim's algorithm
... A is 5 away, B is 9, E is 15, and F is 6. Of ... A. B is 9 away (from D), E is 15, and F is 6. 6 ... this case, we can choose between C, E, and G. C is 8 away from B, E is 7 away from B, and G is 11 away from F. E is nearest, so we highlight the ...
http://en.wikipedia.org/wiki/Prim's_algorithm - 10k - Cached - Similar pages
|
Algorithm (translated from German)
... of Ada Lovelace, in their notes too Charles Babbages Analytical engine, held. It is therefore considered as the first Programmiererin. Because Charles Babbage could not complete its Analytical engine ... Complexity classes MMIX (virtual machine of Donald E. Knuth to the representation of algorithms) On ... procedure Stochastic algorithm Search method Literature John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman. Introduction ... 2002. ISBN 3-8273-7020-5. Donald E. Knuth : The kind OF computer Programming, ...
http://de.wikipedia.org/wiki/Algorithmus - 27k - Cached (German) - Wikipedia (German) - Similar pages
|
Fast Fourier transform
... f_j = \sum_{k=0}^{n-1} x_k e^{-{2\pi i \over n} jk } \qquad ... have been designed for this situation (see e.g. Sorensen, 1987). One approach consists of taking an ordinary algorithm (e.g. Cooley-Tukey) and removing the redundant ... the DFT exactly (in exact arithmetic, i.e. neglecting floating-point errors). A few "FFT ... are typically quite small; most FFT algorithms, e.g. Cooley-Tukey, have excellent numerical ...
http://en.wikipedia.org/wiki/Fast_Fourier_transform - 32k - Cached - Similar pages
|
Depth-first search
... the following order: A, B, D, F, E, C, G. Performing the same search without ... in the order A, B, D, F, E, A, B, D, F, E, etc. forever, caught in the A, B, D, F, E cycle and never reaching C or G ... 0: A 1: A (repeated), B, C, E (Note that iterative deepening has now ...
http://en.wikipedia.org/wiki/Depth-first_search - 7k - Cached - Similar pages
|
Algorithm of Knuth-Pratt-Morris (translated from French)
... indicating for each position a "shift", i.e. the next position where a potential occurrence ... algorithm turns over the position 15 (i.e. E = T[i - 1]e 0e
http://fr.wikipedia.org/wiki/Algorithme_de_Knuth-Pratt-Morris - 39k - Cached (French) - Wikipedia (French) - Similar pages
|
| Page:1 2 3 4 5 6 7 8 9 10 Next >> | | |
