Efficient Magnification of Bi-Level Textures J. Loviscach: Efficient Magnification of Bi-Level Textures 1

First Page		Document Content
Date: 2008-09-11 16:07:03 Computer graphics Texture filtering Mipmap Thresholding Magnification Spatial anti-aliasing Texture mapping Shader Texture Anisotropic filtering		Efficient Magnification of Bi-Level Textures J. Loviscach: Efficient Magnification of Bi-Level Textures 1 Add to Reading List Source URL: www.j3l7h.de Download Document from Source Website File Size: 1,13 MB Share Document on Facebook

	Fast Randomized Singular Value Thresholding for Nuclear Norm Minimization Tae-Hyun Oh∗ KAIST thoh.kaist.ac.kr @gmail.com DocID: 1vfgm - View Document
	NEIGHBORHOOD SELECTION FOR THRESHOLDING-BASED SUBSPACE CLUSTERING Reinhard Heckel, Eirikur Agustsson, and Helmut B¨olcskei Dept. IT & EE, ETH Zurich, Switzerland ABSTRACT Subspace clustering refers to the problem of clu DocID: 1tMs7 - View Document
	SUBSPACE CLUSTERING VIA THRESHOLDING AND SPECTRAL CLUSTERING Reinhard Heckel and Helmut B¨olcskei Dept. of IT & EE, ETH Zurich, Switzerland ABSTRACT We consider the problem of clustering a set of highdimensional data po DocID: 1tJ0c - View Document
	Robust Subspace Clustering via Thresholding Reinhard Heckel and Helmut B¨olcskei Dept. of IT & EE, ETH Zurich, Switzerland July 2013; last revised AugustAbstract DocID: 1tI2F - View Document
	Noisy Subspace Clustering via Thresholding Reinhard Heckel and Helmut B¨olcskei Dept. of IT & EE, ETH Zurich, Switzerland Email: {heckel,boelcskei}@nari.ee.ethz.ch Abstract We consider the problem of clustering noisy hi DocID: 1tCE9 - View Document