Algorithm - PDFSEARCH.IO - Document Search Engine

Algorithm
Results: 17634

#	Item
791	Computer Vision Exercise Session 2 Institute of Visual Computing Add to Reading List Source URL: www.cvg.ethz.ch Language: English - Date: 2015-10-06 15:10:50 Algebra Mathematics Linear algebra Matrices Stereophotogrammetry Matrix theory Fundamental matrix Eight-point algorithm Essential matrix Epipolar geometry Singular value decomposition Matrix
792	Variational Bayesian Learning of Cooperative Vector Quantizer Model - The Theory Add to Reading List Source URL: people.cs.pitt.edu Language: English - Date: 2003-05-06 15:46:12 Statistics Statistical models Bayesian network Latent variable Variational Bayesian methods Independent component analysis Expectationmaximization algorithm Generative model Principal component analysis Bayesian inference Normal distribution Mixture model
793	Inversion Modulo Zero-dimensional Regular Chains ´ Marc Moreno Maza, Eric Schost, and Paul Vrbik Department of Computer Science, Western University Add to Reading List Source URL: www.csd.uwo.ca Language: English - Date: 2012-12-05 23:46:14 Algebra Mathematics Linear algebra Matrix theory Multiplication Numerical linear algebra Matrices Invertible matrix Determinant Matrix Extended Euclidean algorithm Gaussian elimination
794	Face Recognition with Occlusions in the Training and Testing Sets Add to Reading List Source URL: www2.ece.ohio-state.edu Language: English - Date: 2008-11-19 13:58:59 Machine learning Artificial intelligence Image segmentation K-nearest neighbors algorithm Face recognition Learning
795	CS364A: Algorithmic Game Theory Lecture #10: Kidney Exchange and Stable Matching∗ Tim Roughgarden† October 23, Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2015-09-22 16:36:22 Graph theory Mathematics Matching Kidney transplantation Organ transplantation HopcroftKarp algorithm 3-dimensional matching
796	Exercise 1: It’s a Colorful Life Task 1: How the Colors Get into the Trees 1. Change the Cole-Vishkin algorithm from the lecture so that it requires only 1/2 · log∗ n + O(1) rounds. The result should still be a mess Add to Reading List Source URL: resources.mpi-inf.mpg.de Language: English - Date: 2014-10-28 15:42:58 Graph theory NP-complete problems Graph coloring Independent set Maximal independent set
797	LNCSFixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction Add to Reading List Source URL: www.cs.tau.ac.il Language: English - Date: 2009-01-01 08:42:54 Computational complexity theory Graph theory Mathematics Phylogenetics NP-complete problems Computational phylogenetics Analysis of algorithms Probabilistic complexity theory Randomized algorithm Steiner tree problem Algorithm Maximum parsimony
798	CS264: Beyond Worst-Case Analysis Lecture #20: From Unknown Input Distributions to Instance Optimality∗ Tim Roughgarden† December 3, 2014 Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2014-12-29 00:22:18 Operations research Algorithm Mathematical logic Theoretical computer science Mathematical optimization Academia Mathematics Applied mathematics Dynamic programming Randomized algorithms as zero-sum games Randomized rounding
799	FROM COMPUTER CARTOGRAPHYTO SPATIAL VISUALIZATION: A NEW CARTOGRAM ALGORITHM BIBLIOGRAPHIC SKETCH Add to Reading List Source URL: mapcontext.com Language: English - Date: 2008-08-29 22:10:21 Software engineering Computer programming Cartogram Diagrams Computing Pointer Stack Recursion
800	Mathematics for Computer Science Eric Lehman and Tom Leighton 2004 2 Add to Reading List Source URL: www.cs.princeton.edu Language: English - Date: 2006-08-23 14:28:28 Mathematics Graph theory Discrete mathematics NP-complete problems Graph coloring Algebra Recurrence relation Theory of computation Number theory Algorithm Independent set Mathematical induction

UPDATE