Efficient Parallel Set-Similarity Joins Using MapReduce

First Page		Document Content
Date: 2013-04-16 21:54:23 Parallel computing Distributed computing architecture MapReduce Compiler construction Data-intensive computing Lexical analysis Hash function Data Typetoken distinction Function Parallelization contract		Efficient Parallel Set-Similarity Joins Using MapReduce Add to Reading List Source URL: flamingo.ics.uci.edu Download Document from Source Website File Size: 691,90 KB Share Document on Facebook

	Visual Sedimentation Samuel Huron, Romain Vuillemot, Jean-Daniel Fekete To cite this version: Samuel Huron, Romain Vuillemot, Jean-Daniel Fekete. Visual Sedimentation. IEEE Transactions on Visualization and Computer Grap DocID: 1rhAK - View Document
	Microsoft Word - D5.2.B.doc DocID: 1rdI2 - View Document
	Using Strong’s Numbers in the Bible to test an Automatic Alignment of Parallel texts MICHAEL CYSOUW, Max Planck Institute for Evolutionary Anthropology, Leipzig CHRISTIAN BIEMANN, University of Leipzig MATTHIAS ONGYERT DocID: 1qKtw - View Document
	Machine Learning Approach for Language Identification & Transliteration: Shared Task Report of IITP-TS Deepak Kumar Gupta Shubham Kumar DocID: 1qDkn - View Document
	Black Hole Search and Exploration in Unoriented Tori with Synchronous Scattered Finite Automata Euripides Markou1,? and Michel Paquette2,?? 1 DocID: 1qA8l - View Document