Create the page "Algorithms" on this wiki! See also the search results found.

Page title matches

Page text matches

  • CNSIPseminars
    ...signal processing strategies to achieve their excellent performance. These algorithms also incorporate characteristics of the human visual system (HVS), but typi
    5 KB (656 words) - 14:36, 4 May 2011
  • Insertion sort
    [[Category:Sorting algorithms]]
    2 KB (269 words) - 13:01, 14 January 2009
  • ECE608 (GhafoorSpring2009)
    ===Reviewed Algorithms===
    3 KB (441 words) - 17:45, 22 October 2010
  • Merge sort
    [[Category:Sorting algorithms]]
    2 KB (248 words) - 13:05, 14 January 2009
  • Heap sort
    [[Category:Sorting algorithms]]
    2 KB (357 words) - 20:51, 20 February 2009
  • Rhea's story
    ...ucation research to study these tools, and engineering research to develop algorithms and software to sustain them. You can learn more on the [https://engineerin
    5 KB (740 words) - 11:50, 5 October 2012
  • P = NP MA375Fall2008walther
    asymptotically faster algorithms may exist. in order to understand and analyze this question, academic backg
    5 KB (886 words) - 06:38, 21 March 2013
  • Ben Franklin's Magic Square MA453Fall2008walther
    [http://mathworld.wolfram.com/MagicSquare.html Magic Square explanation and algorithms]
    265 B (38 words) - 17:39, 29 October 2008
  • ECE662:Glossary Old Kiwi
    .... Some algorithms, like k-means, simply partition the feature space. Other algorithms, like single-link agglomeration, create nested partitionings which form a t ....dei.polimi.it/matteucc/Clustering/tutorial_html/ A tutorial on clustering algorithms]
    31 KB (4,832 words) - 18:13, 22 October 2010
  • Clustering Old Kiwi
    Some of the widely used algorithms for clustering include: * Survey of Clustering Algorithms, by Rui Xu and Donald Wunsch, IEEE Journal of Neural Networks, Vol 16, May
    8 KB (1,173 words) - 12:41, 26 April 2008
  • Homework 2 Old Kiwi
    ...box/ann/ Tool box holding a collection of Artificial Neural Networks (ANN) algorithms implemented for Matlab] : It contains lots of pattern recognition algorithms and gives the description and pesudo code of them.
    5 KB (746 words) - 16:33, 17 April 2008
  • Lecture 14 - ANNs, Non-parametric Density Estimation (Parzen Window) Old Kiwi
    ...nearest neighbor algorithm is amongst the simplest of all machine learning algorithms. An object is classified by a majority vote of its neighbors, with the obje ...ally when the size of the training set grows. Many nearest neighbor search algorithms have been proposed over the years; these generally seek to reduce the numbe
    13 KB (2,073 words) - 08:39, 17 January 2013
  • Textbooks Old Kiwi
    * A great reference if you are going to be developing pattern recognition algorithms * A great reference if you are going to be using the algorithms
    3 KB (340 words) - 17:58, 6 March 2008
  • Bayes Classification: Experiments and Notes Old Kiwi
    ...ollowing. We only have two classes, Class 1 and Class 2. You can test your algorithms for different priori probabilities for Class 1 and Class 2. However if you
    4 KB (735 words) - 22:49, 8 March 2008
  • ECE662:ChangeLog Old Kiwi
    * 2008/04/24 -- Added more notes on clustering algorithms * 2008/04/16 -- Created [[Lecture 25 - Clustering Algorithms_Old Kiwi]] (Algorithms for clustering from feature vector: All texts and equations 2-1 ~ 2-15)
    10 KB (1,418 words) - 12:21, 28 April 2008
  • What is Pattern Recognition Old Kiwi
    * Most algorithms do not scale well (example given of 2000 faces vs. 2 million faces in an ai * Most algorithms do well on the training data but fail miserably on real data.
    3 KB (436 words) - 08:43, 10 April 2008
  • Parametric Estimators Old Kiwi
    ...P equation is generally non-linear, and thus requires the use of iterative algorithms to compute a numerical solution as analytical expressions are not usually a
    6 KB (995 words) - 10:39, 20 May 2013
  • Tools Old Kiwi
    ...l uses artificial intelligence techniques like neural networks and genetic algorithms to find an optimal solution to classification problems. This description wa * Efficient Algorithms for K-Means [http://www.cs.umd.edu/~mount/Projects/KMeans]
    2 KB (307 words) - 17:13, 21 April 2008
  • "Pattern Classification" by Duda, Hart, and Stork Old Kiwi
    ...on pattern recognition. A great reference if you are going to be using the algorithms
    395 B (51 words) - 23:45, 11 March 2008
  • "Introduction to Statistical Pattern Recognition" by K. Fukunaga Old Kiwi
    ...e. A great reference if you are going to be developing pattern recognition algorithms
    917 B (96 words) - 05:06, 25 August 2010
  • "Introduction to Data Mining" by P-N Tan, M. Steinbach and V. Kumar Old Kiwi
    ...book is a very good reference for classification algorithms and clustering algorithms and analysis. The book's website contains very useful extra material, inclu
    654 B (88 words) - 00:12, 12 March 2008
  • Publications Old Kiwi
    ===A paper explaining several neural-network algorithms including perceptron=== ...echnique) are described. The concept underlying these iterative adaptation algorithms is the minimal disturbance principle, which suggests that during training i
    39 KB (5,715 words) - 10:52, 25 April 2008
  • Applications of Pattern Recognition Old Kiwi
    2. Machine Learning Algorithms for Surveillance and Event Detection
    6 KB (905 words) - 12:18, 28 April 2008
  • Face detection vs Face recognition Old Kiwi
    ...algorithms focused on the detection of frontal human faces, whereas newer algorithms attempt to solve the more general and difficult problem of multiview face d
    2 KB (384 words) - 18:08, 16 March 2008
  • Gradient Descent Old Kiwi
    Gradient descent algorithms are iterative methods for finding the minimum of a function in <math>\Re^n< ...and is itself a function that differs between the various gradient descent algorithms. Lastly, <math>\nabla f(x^{(k)})</math> is the [[gradient_Old Kiwi]] of the
    1 KB (201 words) - 10:46, 24 March 2008
  • Perceptron Convergence Theorem Old Kiwi
    ...bpLbO4n0XjrgzhEuOD06Xfmo#PPA261,M1 Learning Kernel Classifiers, Theory and Algorithms By Ralf Herbrich]
    3 KB (446 words) - 06:36, 21 April 2013
  • Decision Tree Old Kiwi
    ...are used and a search must be made for optimal combining weights. Pruning algorithms can also be expensive since many candidate sub-trees must be formed and com ...cision trees do not treat well non-rectangular regions. Most decision-tree algorithms only examine a single field at a time. This leads to rectangular classifica
    2 KB (264 words) - 09:29, 10 April 2008
  • Graphical Models Old Kiwi
    ...h-theoretic framework has allowed for the development of general inference algorithms, which in many cases provide orders of magnitude speedups over brute-force
    709 B (100 words) - 17:44, 1 April 2008
  • Lecture 22 - Decision Trees and Clustering Old Kiwi
    "Algorithms for clustering data," A.K. Jain, R.C. Dibes[http://www.cse.msu.edu/~jain/Cl Clustering algorithms can also be classified as follows:
    6 KB (806 words) - 08:42, 17 January 2013
  • Hierarchical clustering Old Kiwi
    When we implement Hierarchical clustering algorithms we use an iterative procedure. Here is an example of how the so-called sing
    987 B (148 words) - 16:01, 6 April 2008
  • Mixture of Gaussians Old Kiwi
    ...thod of this kind is the one based on learning a mixture of Gaussians. The algorithms works in this way:
    967 B (155 words) - 16:22, 6 April 2008
  • Lecture 23 - Spanning Trees Old Kiwi
    => Same result as "Single linkage algorithms"
    7 KB (1,060 words) - 08:43, 17 January 2013
  • Lecture 24 - Clustering and Hierarchical Clustering Old Kiwi
    ==Agglomerate Algorithms for Hierarchical Clustering (from Distances)== [http://www.cs.man.ac.uk/~graham/cs2022/greedy/ Greedy and Minimum Spanning Algorithms]
    8 KB (1,254 words) - 08:43, 17 January 2013
  • Minimum Spanning Trees Old Kiwi
    ...trees. A minimum spanning tree can be determined using Prim's or Kruskal's algorithms. Also see Prim's Algorithm and Kruskal's Algorithm.
    628 B (112 words) - 11:46, 11 April 2008
  • Graph Algorithms Old Kiwi
    =Graph Algorithms= When we want to implement graph algorithms on computer we can use one the 2 techniques:
    3 KB (557 words) - 17:49, 22 October 2010
  • Lecture 25 - Clustering Algorithms Old Kiwi
    == Algorithms for clustering from feature vector ==
    8 KB (1,259 words) - 08:43, 17 January 2013
  • Clustering Algorithms Old Kiwi
    == Various Clustering Algorithms == ...oblem, ideal solutions have exponential running time. For this reason, the algorithms presented by this group are sub-optimal, but run in polynomial time. [http:
    3 KB (585 words) - 14:39, 20 April 2008
  • Bayes classification Old Kiwi
    ...e used in practice, it represents an ideal classification rate which other algorithms may attempt to achieve.
    2 KB (399 words) - 14:03, 18 June 2008
  • Lecture 26 - Statistical Clustering Methods Old Kiwi
    ...(or agglomerative) approach to clustering. Different from many clustering algorithms, this one uses a so-called "Rissanen criterion" or "minimum description len
    8 KB (1,244 words) - 08:44, 17 January 2013
  • Spectral Methods Old Kiwi
    ...effective use of several pattern recognition techniques such as clustering algorithms. Here we review the most popular spectral methods.
    2 KB (238 words) - 10:41, 28 April 2008
  • Clustering Sequences Old Kiwi
    .... Some algorithms, like k-means, simply partition the feature space. Other algorithms, like single-link agglomeration, create nested partitionings which form a t
    781 B (110 words) - 08:32, 24 April 2008
  • Neural Networks using Genetic Algorithms Old Kiwi
    ===Using Genetic Algorithms in Computer Learning:=== Genetic Algorithms (GA) (http://en.wikipedia.org/wiki/Genetic_algorithm) are a method of deter
    2 KB (288 words) - 11:51, 25 April 2008
  • ECE662:BoutinSpring08 OldKiwi
    * [[Lecture 25 - Clustering Algorithms_OldKiwi|Lecture 25 - Clustering Algorithms]] * [[Learning algorithms_OldKiwi|Learning algorithms]] (blank in old QE)
    7 KB (875 words) - 07:11, 13 February 2012
  • Peer Legacy ECE495VIP
    ...it [[ECE495VIP|ECE495 - VIP]] this semester and was working on improvising algorithms to program on Graphic Processing Units (GPGPU team). Anybody interesting in
    5 KB (879 words) - 04:52, 13 December 2010
  • Super Tetris
    ...ent a one-step look-ahead and zero-step look-ahead Tetris algorithm. These algorithms were designed for normal Tetris, but the same ideas could be translated int [[Media:TetrisPresentation.ppt | Presentation over algorithms for Tetris AI]] (Unfortunately the videos do not work)
    813 B (126 words) - 16:48, 14 November 2013
  • Lossy versus Lossless Images
    ...as '''''lossless'''''. This means that with the aforementioned compression algorithms, the original signal can be faithfully ''reconstructed exactly, bit-by-bit' ...aq/part1/]). (This would reduce the 30 MB file down to about 15 MB.) These algorithms seek to reduce redundancies in the data by representing repeated data with
    6 KB (914 words) - 12:07, 22 October 2009
  • Homework3ECE438JPEG
    ...y zeroes. Once the numbers in the matrix are re-arranged, various encoding algorithms (including Huffman encoding which uses common trends in the DC values to pr
    5 KB (850 words) - 09:00, 23 September 2009
  • Student summary spectral analysis 2D signalsb
    ...mes also "Lenna"), is a famous image utilized in standard image processing algorithms and testing. The background behind this image is quite interesting. Here ar
    8 KB (1,397 words) - 11:23, 18 March 2013
  • ECE495 GPGPU Fall 09
    *<B>Data Analysis algorithms</B>
    592 B (78 words) - 12:37, 30 November 2009
  • Peer Legacy ECE438
    ...hen in lab we would apply them to real digital images in MATLAB by writing algorithms that would modify the images pixel by pixel. Very cool! --[[User:cpfeiffe|
    17 KB (3,004 words) - 08:11, 15 December 2011
  • ECE662 topic1 discussions
    ...I'm working with Prof. George Lee on Cognitive Robotics. Machine Learning algorithms have been used for place recognition for mobile robots. We are investigatin
    8 KB (1,359 words) - 04:54, 6 May 2010
  • What is Pattern Recognition OldKiwi
    * Most algorithms do not scale well (example given of 2000 faces vs. 2 million faces in an ai * Most algorithms do well on the training data but fail miserably on real data.
    3 KB (462 words) - 10:41, 10 June 2013
  • Bayes Rate Fallacy: Bayes Rules under Severe Class Imbalance
    [2] C. Drummond and R. Holte: Severe Class Imbalance: Why Better Algorithms Aren’t the Answer. In: J. Gama et al. (Eds.): ECML 2005, LNAI 3720, pp. 5
    5 KB (694 words) - 12:41, 2 February 2012
  • Homework 2 OldKiwi
    ...box/ann/ Tool box holding a collection of Artificial Neural Networks (ANN) algorithms implemented for Matlab] : It contains lots of pattern recognition algorithms and gives the description and pesudo code of them.
    5 KB (761 words) - 10:53, 13 April 2010
  • Clustering
    ...tin [[Lecture_25_-_Clustering_Algorithms_OldKiwi|Lecture 25 on Clustering Algorithms]] ...tin [[Lecture_25_-_Clustering_Algorithms_OldKiwi|Lecture 25 on Clustering Algorithms]]
    2 KB (275 words) - 10:36, 27 April 2010
  • EE662Sp10 HiddenMarkovModel
    ...ities). Because of the specialty of Hidden Markov Models, lots of specific algorithms are developed. In order to solve these problems, the following algorithms are proposed:
    4 KB (710 words) - 18:50, 9 May 2010
  • Decision Theory Glossary ECE662Spring2008
    .... Some algorithms, like k-means, simply partition the feature space. Other algorithms, like single-link agglomeration, create nested partitionings which form a t ....dei.polimi.it/matteucc/Clustering/tutorial_html/ A tutorial on clustering algorithms]
    31 KB (4,787 words) - 18:21, 22 October 2010
  • Solving the Cube, Group 4 Style
    After doing initial research on optimized cube solving algorithms and the A* search (courtesy Prof. Kulkarni), we came across [http://kociemb
    2 KB (398 words) - 06:41, 6 December 2010
  • ECE301inBME
    **Signal processing and filtering algorithms to create stethoscopes that function in high-noise environments such as hel ...an tissues, as well as individual cells and molecules, using sophisticated algorithms to analyze numerical images. &nbsp;Research also uses non-invasive optical
    17 KB (2,368 words) - 10:53, 6 May 2012
  • Hw5 ECE438F11
    ...algorithms to compute a 6 point DFT. Draw a flow diagram for each of your algorithms, and compute the total number of complex operations they would require. Com
    2 KB (384 words) - 03:55, 31 August 2013
  • Audio Signal Generating and Processing Project, Previous method
    ::After some research reading online materials about mixing audios, several algorithms are tried, but a clear mix sound is still not founded. An article online me
    6 KB (931 words) - 20:33, 15 November 2011
  • Linear programming MA265F11Walther
    Introduction to deterministic optimization modeling and algorithms in operations research. Emphasis on formulation and solution of linear prog
    5 KB (736 words) - 09:14, 11 April 2013
  • On East Asia Mathematics
    ...themselves, but the receptions of those magic squares. Instead of devising algorithms for the construction of magic squares, as western mathematicians did, Chine
    6 KB (928 words) - 10:46, 15 December 2011
  • Professional statement alex layton ECE400S12
    ...nvolve developing or modifying computer programs. I can implement advanced algorithms, and debug complex software. Additionally, all my experience with micro-con
    5 KB (721 words) - 12:18, 9 February 2012
  • Professional statement MichaelKobit ECE400S12
    ...rience in embedded systems, logic design, mobile applications, web design, algorithms, game design, and low level circuit design. The various classes and topics
    2 KB (316 words) - 19:58, 1 February 2012
  • Prefessional statement johnjachna ECE400S12
    ...r includes ECE classes such as Advanced C programming, Data Structures and Algorithms, Linear Circuit Analysis, Digital System Design, and Microprocessor Systems
    6 KB (964 words) - 12:19, 9 February 2012
  • Professional statement Krishna ECE400S12
    ...that dealt with ASIC Chips and microprocessors. My project was to develop algorithms and prototypes using the most advanced programming languages that would pro
    3 KB (534 words) - 12:22, 9 February 2012
  • Upsham Dawra - Professional Statement
    During my education at Purdue, I undertook classes like Data Structures, Algorithms, Microcontrollers, Computer Architecture and Compilers, along with classes ...nd expanded my skill-set a lot over the summer, especially in graphing and algorithms.
    3 KB (550 words) - 12:22, 9 February 2012
  • Professional statement YiYue ECE400S12
    .... What I do in this project is mainly translating existing computer vision algorithms into C++, and allowing robots to navigate in an environment with obstacles.
    4 KB (563 words) - 12:21, 9 February 2012
  • Bayes Classification: Experiments and Notes OldKiwi
    ...ollowing. We only have two classes, Class 1 and Class 2. You can test your algorithms for different priori probabilities for Class 1 and Class 2. However if you
    5 KB (772 words) - 11:05, 10 June 2013
  • Lecture 14 - ANNs, Non-parametric Density Estimation (Parzen Window) OldKiwi
    ...nearest neighbor algorithm is amongst the simplest of all machine learning algorithms. An object is classified by a majority vote of its neighbors, with the obje ...ally when the size of the training set grows. Many nearest neighbor search algorithms have been proposed over the years; these generally seek to reduce the numbe
    13 KB (2,098 words) - 11:21, 10 June 2013
  • Lecture 22 - Decision Trees and Clustering OldKiwi
    "Algorithms for clustering data," A.K. Jain, R.C. Dibes[http://www.cse.msu.edu/~jain/Cl Clustering algorithms can also be classified as follows:
    6 KB (837 words) - 11:23, 10 June 2013
  • Lecture 23 - Spanning Trees OldKiwi
    => Same result as "Single linkage algorithms"
    7 KB (1,091 words) - 11:23, 10 June 2013
  • Lecture 24 - Clustering and Hierarchical Clustering OldKiwi
    ==Agglomerate Algorithms for Hierarchical Clustering (from Distances)== [http://www.cs.man.ac.uk/~graham/cs2022/greedy/ Greedy and Minimum Spanning Algorithms]
    9 KB (1,276 words) - 11:24, 10 June 2013
  • Lecture 25 - Clustering Algorithms OldKiwi
    == Algorithms for clustering from feature vector ==
    8 KB (1,299 words) - 11:24, 10 June 2013
  • Lecture 12 ECE264F12Lu
    * Can be changed fro new features, bug fixes, better algorithms
    1 KB (232 words) - 05:24, 11 July 2012
  • Parametric Estimators OldKiwi
    ...P equation is generally non-linear, and thus requires the use of iterative algorithms to compute a numerical solution as analytical expressions are not usually a
    6 KB (976 words) - 13:25, 8 March 2012
  • Lecture 26 - Statistical Clustering Methods OldKiwi
    ...(or agglomerative) approach to clustering. Different from many clustering algorithms, this one uses a so-called "Rissanen criterion" or "minimum description len
    8 KB (1,214 words) - 11:24, 10 June 2013
  • Greedy methods MA375S12Walther
    *None of the above algorithms can guarantee the optimal solution.<br>o This is not surprising since this *Of the above three algorithms, the third one is probably the best heuristic.<br>Topological Ordering
    10 KB (1,828 words) - 07:01, 21 March 2013
  • Peer Legacy ECE368
    ...uctures, but the basis is Algorithms. In fact, there is a CS course called Algorithms that is almost identical to this course. When I took this course, our final
    870 B (147 words) - 06:09, 24 April 2012
  • ECE PhD Qualifying Exams
    **Question 1: Algorithms
    8 KB (952 words) - 22:00, 1 August 2019
  • Camera LCD Interfacing
    ...ndomly access pixels from the LCD, which is necessary for image processing algorithms that perform local operations. This is much appreciated, as the camera's F
    3 KB (533 words) - 15:17, 1 May 2016
  • DYL RADIXFLOAT
    During a CS251: Data Structure &amp; Algorithms lecture about various sorting algorithms, Professor Aliaga mentioned a sorting algorithm of linear running time - ra It's well known that the comparison sorting algorithms have a theoretical lower bound of <span class="texhtml">''n''log''n''</span
    7 KB (1,030 words) - 11:27, 18 March 2013
  • Lab 3 Additional Information ECE637 Spring2013 Bouman
    ...any ways to solve the problem. As long as you have your runtime (including algorithms) and termination condition correct, you should do just fine. The lab is mer
    2 KB (377 words) - 08:10, 9 April 2013
  • ECE662 Pattern Recognition Decision Making Processes Spring2008 sLecture collective
    * [[Lecture 25 - Clustering Algorithms_OldKiwi|Lecture 25 - Clustering Algorithms]]
    3 KB (425 words) - 09:59, 4 November 2013
  • Textbooks OldKiwi
    * A great reference if you are going to be developing pattern recognition algorithms * A great reference if you are going to be using the algorithms
    3 KB (372 words) - 10:39, 10 June 2013
  • Perceptron Convergence Theorem OldKiwi
    ...bpLbO4n0XjrgzhEuOD06Xfmo#PPA261,M1 Learning Kernel Classifiers, Theory and Algorithms By Ralf Herbrich]
    3 KB (445 words) - 06:37, 21 April 2013
  • Walther279Fall13 Topic3
    ...ve to describe two key ingredients: allowable votes, i.e., ballots and the algorithms of collecting votes. In this study, we will study how various voting system
    17 KB (2,510 words) - 18:36, 1 December 2013
  • HW7ECE438F13
    ...algorithms to compute a 6 point DFT. Draw a flow diagram for each of your algorithms, and compute the total number of complex operations they would require. Com
    2 KB (388 words) - 11:43, 11 October 2013
  • Walther453Fall13 Topic13 paper
    ...es are accessible to everyone.<br> <br>Based on mathematics:<br>Public-key algorithms are based on mathematical problems which currently admit no efficient solut ...ions have been secured by the first generation of public key cryptographic algorithms developed in the mid-1970's. Notably, they form the basis for key managemen
    19 KB (3,051 words) - 22:23, 4 December 2013
  • 2014 Spring MA 375 Walther
    ...ther375Spring2014 P=NP and complexity of algorithms|P=NP and complexity of algorithms]]
    5 KB (724 words) - 11:13, 27 April 2014
  • 2014 Spring ECE 662 Boutin
    *Slectures on Clustering Algorithms (supplemental material)
    10 KB (1,450 words) - 20:50, 2 May 2016
  • Walther375Spring2014 P=NP and complexity of algorithms
    ...lynomial time. Since then the focus has shifted to efficient approximation algorithms with precise performance guarantees.
    13 KB (2,101 words) - 13:55, 27 April 2014
  • Bayes Parameter Estimation
    ...es are required. There are many different types of numerical approximation algorithms in Bayesian inference, such as Approximate Bayesian Computation (ABC),Lapla
    15 KB (2,273 words) - 10:51, 22 January 2015
  • Generation-of-normally-distributed-random-numbers-under-a-binary-prior-probability
    ...m the normal distribution lies at the heart of many probabilistic learning algorithms.
    16 KB (2,400 words) - 23:34, 29 April 2014
  • CBR logistic regression
    ...one major topic is classification problem. Linear classifier is a class of algorithms that make the classification decision on a new test data point base on a li
    9 KB (1,540 words) - 10:56, 22 January 2015
  • Generation of N-dimensional normally distributed random numbers from two categories with different priors
    ...m the normal distribution lies at the heart of many probabilistic learning algorithms. The probability distribution function for the normal distribution is defin
    18 KB (2,852 words) - 10:40, 22 January 2015
  • LinearClassierSlectureJMS
    ...estimation based tests could require much more complicated calculations or algorithms to classify data points. If the data is roughly linearly separable, the oth
    10 KB (1,684 words) - 13:00, 5 May 2014
  • JMSLinearClassifierSlecture
    ...estimation based tests could require much more complicated calculations or algorithms to classify data points. If the data is roughly linearly separable, the oth
    10 KB (1,666 words) - 10:56, 22 January 2015
  • 2014 Spring ECE 662 Boutin Statistical Pattern recognition slectures
    *Clustering Algorithms
    8 KB (1,123 words) - 10:38, 22 January 2015
  • Slecture rep comb ECE438 Xiaozhe
    ...roakis, Dimitris G. Manolakis, "Digital Signal Processing with Principles, Algorithms, and Applications" 4th Edition,2006
    5 KB (768 words) - 18:51, 16 March 2015
  • Nyquist Miguel Castellanos ECE438 slecture
    ...roakis, Dimitris G. Manolakis, "Digital Signal Processing with Principles, Algorithms, and Applications" 4th Edition,2006
    6 KB (1,008 words) - 19:04, 16 March 2015
  • HW6ECE438F14
    ...algorithms to compute a 6 point DFT. Draw a flow diagram for each of your algorithms, and compute the total number of complex operations they would require. Com
    2 KB (394 words) - 02:19, 7 October 2014
  • Upsampling Slecture Molveraz
    [4]. Charles A. Poynton, "Digital Video and HDTV: Algorithms and Interfaces", 2003. ...roakis, Dimitris G. Manolakis, "Digital Signal Processing with Principles, Algorithms, and Applications" 4th Edition,2006
    5 KB (790 words) - 10:01, 14 March 2015
  • Embedded Fixed Point FFT
    ...decimal point moved in the number. Many microcontrollers and embedded FFT algorithms utilize binary fractions. Binary numbers have each bit correspond to a <spa
    9 KB (1,362 words) - 18:06, 23 February 2015
  • 2015 Summer Cryptography Paar Introduction to Crpytography Divya Agarwal and Katie Marsh
    ==== 1. Symmetric Algorithms : ==== ==== 2. Asymmetric Algorithms : ====
    3 KB (405 words) - 11:03, 19 June 2015
  • HW7ECE38F15
    ...algorithms to compute a 6 point DFT. Draw a flow diagram for each of your algorithms, and compute the total number of complex operations they would require. Com
    2 KB (243 words) - 15:09, 20 October 2015
  • HW7ECE438F15 Soln
    ...algorithms to compute a 6 point DFT. Draw a flow diagram for each of your algorithms, and compute the total number of complex operations they would require. Com
    6 KB (971 words) - 15:24, 20 October 2015
  • ECE PhD QE CNSIP 2015 Problem1.3
    [[Category:algorithms]] Question 1: Algorithms
    2 KB (243 words) - 22:00, 7 March 2016
  • 2016 Spring MA 279 Walther
    | [[Walther_MA279_Spring2016_topic12|The economic impact of mathematical algorithms in society]]
    4 KB (628 words) - 12:20, 23 January 2016
  • Walther MA279 Spring2016 topic5
    ...rim algorithm and Boruvka algorithm to solve the same problem. These three algorithms are the application of the greedy algorithm. The different place between Kr ...nt structure and data cause different approach to application. These three algorithms can be used to find the MST, which could be used in computer networking or
    10 KB (1,524 words) - 23:36, 24 April 2016
  • Walther MA279 Spring2016 topic4
    A Theorem on the Uniqueness of Minimum Spanning Tree. 234247 Algorithms 1, Retrieved Winter 2004/5.<br /> ICS 161: Design and Analysis of Algorithms: https://www.ics.uci.edu/~eppstein/161/960206.html <br />
    14 KB (2,465 words) - 20:07, 24 April 2016
  • Walther MA279 Spring2016 topic10
    '''Scheduling Algorithms''' ...t neither is guaranteed to give the optimal finishing time. However, these algorithms give a close to optimal finishing time, and are useful for scheduling any p
    7 KB (1,196 words) - 21:33, 24 April 2016
  • Walther MA279 Spring2016 topic2
    ...s, human crowds, and bird flocking. Often, these systems are modeled using algorithms and then applied to solve specific problems. ...f birds flocking (PSO algorithm). An alternating combination of these two algorithms is used to sketch novel drawings of an input image.
    14 KB (2,177 words) - 11:28, 24 April 2016
  • ECE PhD QE CE 2015 Problem1.4
    [[Category:algorithms]] Question 1: Algorithms
    5 KB (975 words) - 22:15, 7 March 2016
  • ECE-QE CE1-2015
    [[Category:algorithms]] Question 1: Algorithms
    5 KB (766 words) - 22:18, 7 March 2016
  • ECE PhD QE CE 2015 Problem1.1
    [[Category:algorithms]] Question 1: Algorithms
    2 KB (457 words) - 18:09, 7 March 2016
  • ECE PhD QE CE 2015 Problem1.2
    [[Category:algorithms]] Question 1: Algorithms
    858 B (127 words) - 21:43, 7 March 2016
  • ECE PhD QE CE 2015 Problem1.3
    [[Category:algorithms]] Question 1: Algorithms
    2 KB (375 words) - 22:29, 7 March 2016
  • Walther MA279 Spring2016 topic6
    ...d Sohoni have reduced a question about the nonexistence of polynomial-time algorithms for all NP-complete problems to a question about the existence of a polynom
    11 KB (2,028 words) - 20:48, 24 April 2016
  • Walther MA279 Spring2016 topic9
    ...ion for decades. Although no classification has been discovered, there are algorithms for general graphs and special types of graphs to determine isomorphisms. One can ask if there are algorithms for determining such an isomorphism <math> f </math> given any two graphs.
    13 KB (2,051 words) - 22:06, 24 April 2016
  • Walther MA279 Spring2016 topic7
    Dijkstra algorithm belongs to a family of Best First Search algorithms, and therefore used to find the shortest path between two points on a graph ...ous variants of Dijkstra. In general, there are 3 main aspects of Dijkstra algorithms that can be modified or extended: Distance (distance meaning and evaluation
    14 KB (2,351 words) - 23:21, 24 April 2016
  • HW7ECE438F16
    ...algorithms to compute a 6 point DFT. Draw a flow diagram for each of your algorithms, and compute the total number of complex operations they would require. Com
    2 KB (313 words) - 10:53, 14 October 2016
  • Introduction of Optical Character Recognition (ORC)
    ...symbols and numbers. It is still a hot ongoing search area and some novel algorithms are publishing from time to time. It is pretty interesting and essential to
    8 KB (1,405 words) - 22:56, 27 November 2016
  • Creating Blur Detection
    Here are the following steps that are taken for algorithms in edge detection:
    2 KB (258 words) - 04:20, 28 November 2016
  • Quantization and Classification using K-Means Clustering
    Clustering algorithms in general are used to group similar data points together. Data points that
    6 KB (903 words) - 00:02, 24 April 2017
  • An Implementation of Sobel Edge Detection
    ...ng with Canny and Prewitt, Sobel is one of the most popular edge detection algorithms used in today's technology.
    7 KB (1,184 words) - 20:31, 23 April 2017
  • ECE-QE CE1-2013
    [[Category:algorithms]] Question 1: Algorithms
    4 KB (668 words) - 20:23, 21 August 2017
  • ECE PhD QE CE 2013 Problem1.1
    [[Category:algorithms]] Question 1: Algorithms
    4 KB (651 words) - 16:06, 23 August 2017
  • ECE PhD QE CE 2013 Problem1.2
    [[Category:algorithms]] Question 1: Algorithms
    4 KB (667 words) - 16:09, 23 August 2017
  • ECE PhD QE CE 2013 Problem1.3
    [[Category:algorithms]] Question 1: Algorithms
    3 KB (467 words) - 16:07, 23 August 2017
  • ECE PhD QE CE 2013 Problem1.4
    [[Category:algorithms]] Question 1: Algorithms
    6 KB (995 words) - 16:05, 23 August 2017
  • Walther MA279 Fall2018 topic11
    ==Algorithms== Welsh Powell Algorithm: http://graphstream-project.org/doc/Algorithms/Welsh-Powell/
    9 KB (1,411 words) - 22:07, 2 December 2018
  • QE2017 AC-3 ECE580
    For fixed step gradient descent algorithms <math>\alpha</math> should in the range <math>(0,\dfrac{2}{\lambda max(Q)})
    6 KB (899 words) - 01:04, 24 February 2019
  • 2016AC-3-2
    For fixed step gradient descent algorithms <math>\alpha</math> should in the range <math>(0,\dfrac{2}{\lambda max(Q)})
    769 B (106 words) - 16:19, 19 February 2019
  • Walther MA271 Fall2020 topic20
    ...used in the field of image processing. Many optical character recognition algorithms rely on the Fourier transform. It turns out that the Fourier transform of d
    12 KB (2,051 words) - 14:20, 5 December 2020
  • Walther MA271 Fall2020 topic12
    ...using elliptical curves often has a smaller key size compared to competing algorithms.
    13 KB (2,172 words) - 17:46, 30 May 2021
  • Walther MA271 Fall2020 topic24
    ...as the Coq System. The Coq System is a program that can help you "execute algorithms and theorems together with an environment for semi-interactive development
    16 KB (2,725 words) - 00:24, 7 December 2020
  • Introduction to Hidden Markov Chains
    ...nd problem is essentially a “decoding” problem. We can use the Viterbi algorithms to solve problems of this type. The third problem is essentially a machine
    3 KB (568 words) - 13:57, 6 December 2020
  • Swanson MA279 Fall2022 topic11
    ...can join the system of cryptocurrency, and the system is run by consensus algorithms. Therefore, there is no owner of the currency, also it is impossible to man <h1 style="font-size: 30px">Consensus Algorithms</h1>
    24 KB (3,899 words) - 10:51, 1 December 2022
  • Swanson MA279 Fall2022 topic1
    ...ECDSA, to protect our data. These cryptographic<sup>1</sup> protocols and algorithms, though now they seem clever and highly useful, are mainly dependent on the ...can never be carried out in polynomial time. All known classical factoring algorithms do not break this computational "speed limit," but Shor's algorithm shows t
    31 KB (5,039 words) - 17:31, 6 December 2022
  • Swanson MA279 Fall2022 topic9
    The PRNG relies on algorithms and programs to generate a number sequence that seems to be random. But sin ...2, 158734, 652870, and 590998. They look pretty random, and that's how the algorithms work.
    14 KB (2,296 words) - 21:49, 5 December 2022
  • Swanson MA279 Fall2022 topic8
    ...ence by repeatedly using previously calculated values. The infinite series algorithms may be represented as a summation where each term is individually calculabl
    18 KB (2,815 words) - 11:22, 8 December 2022
  • Swanson MA279 Fall2022 topic3
    ...The field of artificial intelligence focuses on training models powered by algorithms that try to emulate human intelligence. These models are trained by funneli ...led from the internet, and the internet is a place filled with biases. The algorithms then generate images that have certain biases depending on the prompt. Taki
    15 KB (2,564 words) - 11:25, 29 November 2022
  • Swanson MA279 Fall2022 topic6
    SHA is a family of one-way hashing algorithms developed by the NSA and is published by the National Institute of Standard ...hy organizations have moved away from SHA-1 to newer, more ethical hashing algorithms.
    24 KB (3,746 words) - 15:31, 10 December 2022
  • Swanson MA279 Fall2022 topic12
    One of the most known and influential algorithms for this is the PageRank algorithm, which we will be exploring in this proj ...he internet’s needs which resulted in one of the company’s most famous algorithms that made them a fortune. However, though the algorithm’s aim was to rema
    21 KB (3,098 words) - 00:24, 1 December 2022

View (previous 250 | next 250) (20 | 50 | 100 | 250 | 500)

Retrieved from "https://www.projectrhea.org/rhea/index.php/Special:Search"
Shortcuts
Help Main Wiki Page Random Page Special Pages Log in
Search

Alumni Liaison

To all math majors: "Mathematics is a wonderfully rich subject."

Dr. Paul Garrett