Yannis Kalantidis National Technical University of Athens Email: PhD thesis: Nearest Neighbor Search and Clustering for Large scale Visual Search Estimated graduation date: November 2014

First Page		Document Content
Date: 2014-06-15 04:09:25 Information science Search algorithms Artificial intelligence Information retrieval Data mining Discrete geometry Nearest neighbor search Numerical analysis Nearest neighbor Image segmentation Conference on Computer Vision and Pattern Recognition K-nearest neighbors algorithm		Yannis Kalantidis National Technical University of Athens Email: PhD thesis: Nearest Neighbor Search and Clustering for Large scale Visual Search Estimated graduation date: November 2014 Add to Reading List Source URL: image.ntua.gr Download Document from Source Website File Size: 178,06 KB Share Document on Facebook

	Understanding Resolution Proofs through Herbrand’s Theorem‹ Stefan Hetzl1 , Tomer Libal2 , Martin Riener3 , and Mikheil Rukhaia4 1 Institute of Discrete Mathematics and Geometry, Vienna University of Technology DocID: 1xTCQ - View Document
	Sage Reference Manual: Combinatorial and Discrete Geometry Release 8.3 The Sage Development Team DocID: 1vfet - View Document
	Hausdorff School: Economics and Tropical Geometry Bonn, May 9-13, 2016 Discrete Convex Analysis III: Algorithms for Discrete Convex Functions Kazuo Murota DocID: 1v6lO - View Document
	Hausdorff School: Economics and Tropical Geometry Bonn, May 9-13, 2016 Discrete Convex Analysis I: Concepts of Discrete Convex Functions Kazuo Murota DocID: 1uq8J - View Document
	Hausdorff School: Economics and Tropical Geometry Bonn, May 9-13, 2016 Discrete Convex Analysis II: Properties of Discrete Convex Functions Kazuo Murota DocID: 1uci8 - View Document