SubSpace - PDFSEARCH.IO - Document Search Engine

SubSpace
Results: 408

#	Item
231	[removed]The Basic Method Proof of Claim[removed]Suppose not. Then for some v, v 0 ∈ A we have u + v = u0 + v 0 , and hence, v + v 0 = u + u0 . Let c, c0 be the vectors from C for which Add to Reading List Source URL: lovelace.thi.informatik.uni-frankfurt.de Language: English - Date: 2007-08-30 03:42:28 Linear combination Projection Basis Dot product Vector space Euclidean vector Comparison of vector algebra and geometric algebra Euclidean subspace Algebra Mathematics Linear algebra
232	Promotion Analysis in Multi-Dimensional Space Tianyi Wu† Dong Xin‡ Qiaozhu Mei† Jiawei Han† † Add to Reading List Source URL: www.vldb.org Language: English - Date: 2009-07-27 10:29:02 Mathematical analysis Functional analysis Operator theory General topology Projection Flag Von Neumann algebra Space Subspace topology Mathematics Algebra Linear algebra
233	Automatic Artifact Identification in Image Communication Using Watermarking and Classification Algorithms Shabnam Sodagari, G. Hossein Hajimirsadeghi, Alireza Nasiri Avanaki Control and Intelligent Processing Center of E Add to Reading List Source URL: www.cs.sfu.ca Language: English - Date: 2008-09-06 06:26:22 Linear classifier Support vector machine Naive Bayes classifier Supervised learning Pattern recognition Principal component analysis Margin classifier Random subspace method Statistics Statistical classification Machine learning
234	SlimPLS: A Method for Feature Selection in Gene Expression-Based Disease Classification Michael Gutkin1, Ron Shamir1, Gideon Dror2 1 Blavatnik school of Computer Science, Tel Aviv University, Tel Aviv, Israel, 2 School Add to Reading List Source URL: www2.mta.ac.il Language: English* - Date: 2010-08-18 18:53:13 Support vector machine Naive Bayes classifier Classifier Binary classification Supervised learning Feature selection Linear discriminant analysis Cross-validation Random subspace method Statistics Machine learning Statistical classification
235	Acta Numerica (2014), pp. 1–155 doi:[removed]S0962492914000038 c Cambridge University Press, 2014 ⃝ Printed in the United Kingdom Add to Reading List Source URL: www.sandia.gov Language: English - Date: 2014-07-08 17:41:14 Numerical linear algebra Matrices Matrix theory Sparse matrices Matrix LU decomposition Sparse matrix Krylov subspace Orthogonal matrix Algebra Linear algebra Mathematics
236	A Subspace Filter Supporting the Discovery of Small Clusters in Very Noisy Datasets Frank Höppner Ostfalia University of Applied Sciences Dept. Computer Science Wolfenbüttel, Germany Add to Reading List Source URL: public.fh-wolfenbuettel.de Language: English - Date: 2014-07-06 17:48:06 Linear algebra Multivariate statistics Data analysis Cluster analysis Data mining Geostatistics DBSCAN K-means clustering OPTICS algorithm Statistics Algebra Mathematics
237	Computing Immutable Regions for Subspace Top-k Queries ∗ Kyriakos Mouratidis Add to Reading List Source URL: www.vldb.org Language: English - Date: 2013-02-19 07:59:37 Relational model Model theory Data management Mathematical notation Tuple Type theory Bin Relational database Immutable object Mathematics Information science Computing
238	Probabilistic Combination of Text Classifiers Using Reliability Indicators: Models and Results Paul N. Bennett Susan T. Dumais Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2002-06-06 18:04:37 Support vector machine Binary classification Margin classifier Classifier Random subspace method Linear classifier Statistics Statistical classification Naive Bayes classifier
239	Signing a Linear Subspace: Signature Schemes for Network Coding Dan Boneh1∗ David Freeman2† Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2008-12-23 09:25:50 Abstract algebra Cryptography Finite fields Mathematical structures Network coding Digital signature Vector space Structure Orthogonality Algebra Mathematics Linear algebra
240	An Efficient Low Memory Implicit DG Algorithm for Time Dependent Problems Per-Olof Persson∗ and Jaime Peraire† Massachusetts Institute of Technology, Cambridge, MA 02139, U.S.A. We present an efficient implicit time Add to Reading List Source URL: raphael.mit.edu Language: English - Date: 2006-02-01 15:02:24 Algebra Preconditioner Generalized minimal residual method Iterative method Sparse matrix Conjugate gradient method Krylov subspace Multigrid method Matrix Numerical linear algebra Numerical analysis Mathematics

UPDATE