In computer science, geometric hashing is a method for efficiently finding two-dimensional objects represented by discrete points that have undergone...

hashing is known as geometric hashing or the grid method. In these applications, the set of all inputs is some sort of metric space, and the hashing function...

Perceptual hashing is the use of a fingerprinting algorithm that produces a snippet, hash, or fingerprint of various forms of multimedia. A perceptual hash is...

eigenvectors of the templates (called eigenfaces) Modelbases are a collection of geometric models of the objects that should be recognized a search is used to find...

between every point in a grid and a discrete collection of points. Geometric hashing: a method for efficiently finding two-dimensional objects represented...

Hogg; Michael Blanton (2006-09-28). "Making the Sky Searchable: Fast Geometric Hashing for Automated Astrometry" (PDF). [cosmo]. W. M. Smart (1977). "XII...

In machine learning, feature hashing, also known as the hashing trick (by analogy to the kernel trick), is a fast and space-efficient way of vectorizing...

families are known (for hashing integers, vectors, strings), and their evaluation is often very efficient. Universal hashing has numerous uses in computer...

Fowler–Noll–Vo hash function: fast with low collision rate Pearson hashing: computes 8-bit value only, optimized for 8-bit computers Zobrist hashing: used in...

bits are required for a valid header, since this requires only a single hashing operation. The Hashcash system has the advantage over micropayment proposals...

... To the untrained eye, the reflectors looked extremely odd, a geometrical hash of lightweight sticks and sharp angles made of metal foil. .. photographs...

geometry Trifocal tensor Active appearance model (AAM) Cross-correlation Geometric hashing Graph cut segmentation Least squares estimation Image pyramid Image...

dynamic arrays based on geometric expansion waste linear (Ω(n)) space, where n is the number of elements in the array, hashed array trees waste only order...

neighbor algorithm Linear least squares Locality sensitive hashing Maximum inner-product search MinHash Multidimensional analysis Nearest-neighbor interpolation...

alignments Zuker 1991 Bachar et al. Structure, topology independent Uses geometric hashing for the topology independent comparison of proteins Bachar et al....

state expandable hashing expander graph exponential extended binary tree extended Euclidean algorithm extended k-d tree extendible hashing external index...

In graph theory, a random geometric graph (RGG) is the mathematically simplest spatial network, namely an undirected graph constructed by randomly placing...

node, bearing the weight of hardware expenses and network bandwidth. Geometric Method (GM) was invented by Meni Rosenfeld. It is based on the same "score"...

a.size ← a.size + 1 As n elements are inserted, the capacities form a geometric progression. Expanding the array by any constant proportion a ensures...

universal one-way function. One-way compression function Cryptographic hash function Geometric cryptography Trapdoor function Oded Goldreich (2001). Foundations...

same as with the previous logo, however, Google switched to a modern, geometric sans-serif typeface called Product Sans, created in-house at Google (which...

Product Sans is a geometric sans-serif typeface created by Google for branding purposes. It replaced the old Google logo on September 1, 2015. As Google's...

Association for Computing Machinery for his work on locality-sensitive hashing. In 2012 his work co-developing the sparse Fourier transform was named...

the first digital signature schemes proposed. By introducing the use of hashing as an essential step in signing, it was the first design to meet what is...

( log ⁡ ( N ) ) {\displaystyle O(\log(N))} per iteration. There is a geometric interpretation of Grover's algorithm, following from the observation that...

k-nearest neighbor searches have been proposed, such as locality-sensitive hashing (LSH) and product quantization (PQ) that trade performance for accuracy...

octree hashing, the Z-order curve naturally iterates the octree in depth-first order. Geohash Hilbert R-tree Linear algebra Locality preserving hashing Matrix...

semantic analysis Local tangent space alignment Locality-sensitive hashing MinHash Multifactor dimensionality reduction Nearest neighbor search Nonlinear...

Friedhelm; Rohnert, Hans; Tarjan, Robert E. (1994), "Dynamic perfect hashing: upper and lower bounds", SIAM Journal on Computing, 23 (4): 738–761, CiteSeerX 10...

as on a ruler or number line Congruence notation in geometry — as on a geometric figure Graphed points — as on a graph Hatch marks are frequently used...