Hashing - PDFSEARCH.IO - Document Search Engine

Hashing
Results: 1317

#	Item
811	Istanbul Technical University at TRECVID 2008 O. Gursoy, B. Gunsel Multimedia Signal Processing and Pattern Recognition Group Department of Electronics and Communications Engineering Istanbul Technical University Maslak/ Add to Reading List Source URL: www-nlpir.nist.gov Language: English - Date: 2008-12-03 08:53:57 Information retrieval Search algorithms Multivariate statistics Matrix theory Hashing Non-negative matrix factorization Digital video fingerprinting Hash function Search engine indexing Information science Mathematics Linear algebra
812	Twitter Chat & Tour Q&A Q? How do I get started? A: First of all you must have a Twitter account, (go to twitter.com). When a chat/tour is set up a hash tag (#) is assigned. To follow the chat/tour go to your Twitter ho Add to Reading List Source URL: www.bannerhealth.com Language: English - Date: 2014-11-29 00:04:21 Hashing World Wide Web Cryptographic hash functions Real-time web Cross-platform software Twitter TweetDeck Hash function Hash list Error detection and correction Computing Software
813	X-Sieve: CMU Sieve 2.2 Date: Fri, 27 Apr 2007 16:58:53 +0900 From: Atsuhiro Yamagishi User-Agent: Thunderbird 1.5.0.10 (Windows/20070221) To: hash-function@nist.gov, shu-jen.chang@nist.gov CC: cryptr Add to Reading List Source URL: csrc.nist.gov Language: English - Date: 2012-06-20 08:08:26 CRYPTREC Collision resistance Random oracle Preimage attack HMAC Hash function Crypt Outline of cryptography SWIFFT Cryptography Cryptographic hash functions Hashing
814	Min-wise hashing for large-scale regression and classification with sparse data arXiv:1308.1269v1 [math.ST] 6 Aug[removed]Rajen D. Shah and Nicolai Meinshausen Add to Reading List Source URL: stat.ethz.ch Language: English - Date: 2013-08-22 09:30:09 Ordinary least squares Logistic regression Principal component analysis Dummy variable Tikhonov regularization Matrix Least squares Polynomial regression Statistics Regression analysis Linear regression
815	No Free Lunch: Brute Force vs. Locality-Sensitive Hashing for Cross-lingual Pairwise Similarity Ferhan Ture1 , Tamer Elsayed2 , Jimmy Lin1,3 1 2 Add to Reading List Source URL: www.umiacs.umd.edu Language: English - Date: 2011-09-05 10:52:26 MinHash Locality-sensitive hashing Cosine similarity Data mining Jaccard index Nearest neighbor search Digital signature Information science Information retrieval Search algorithms
816	Comments on NIST Draft Requirements and Criteria for Hash Algorithm Add to Reading List Source URL: csrc.nist.gov Language: English - Date: 2012-06-20 09:56:14 Error detection and correction Message authentication codes Search algorithms HMAC Hash function Collision Digital signature Algorithm SHA-2 Cryptography Hashing Cryptographic hash functions
817	MISSISSIPPI GAMING COMMISSION Gaming Laboratory Division RESCINDED Signature List: M/D Date Add to Reading List Source URL: www.msgamingcommission.com Language: English - Date: 2014-11-17 16:22:33 SHA-1 Konami Error detection and correction HMAC Hashing
818	X-Sieve: CMU Sieve 2.2 DKIM-Signature: a=rsa-sha1; c=relaxed/relaxed; d=gmail.com; s=beta; h=domainkey-signature:received:received:message-id:date:from:to:subject:mimeversion:content-type; b=hpQBvkv1eVIC20ITx1GF9QzMkMgj4 Add to Reading List Source URL: csrc.nist.gov Language: English - Date: 2012-06-20 08:59:50 Hashing SHA-1 Hash function Preimage attack Collision resistance Cryptography Cryptographic hash functions Search algorithms
819	X-Sieve: CMU Sieve 2.2 From: Tolga Acar To: "hash-function@nist.gov" CC: Brian LaMacchia Date: Fri, 27 Apr 2007 15:44:15 -0700 Subject: Has Add to Reading List Source URL: csrc.nist.gov Language: English - Date: 2012-06-20 09:55:18 Search algorithms Hash function Information retrieval Artificial intelligence Information science Provably secure cryptographic hash function Cryptographic hash functions Cryptography Hashing
820	Chapter 4 Mining Data Streams Most of the algorithms described in this book assume that we are mining a database. That is, all our data is available when and if we want it. In this chapter, we shall make another assumpt Add to Reading List Source URL: i.stanford.edu Language: English - Date: 2014-11-09 17:51:05 Information Database management systems Search algorithms Programming paradigms Database theory Bloom filter Hash function Bin Stream processing Computing Hashing Information science

UPDATE