AI & ChatGPT searches , social queriess for DIFFERENCE MAP-ALGORITHM
Search references for DIFFERENCE MAP-ALGORITHM. Phrases containing DIFFERENCE MAP-ALGORITHM
See searches and references containing DIFFERENCE MAP-ALGORITHM!
Search references for DIFFERENCE MAP-ALGORITHM. Phrases containing DIFFERENCE MAP-ALGORITHM
See searches and references containing DIFFERENCE MAP-ALGORITHM!DIFFERENCE MAP-ALGORITHM
The difference-map algorithm is a search algorithm for general constraint satisfaction problems. It is a meta-algorithm in the sense that it is built
Difference-map_algorithm
satisfiability problem Davis–Putnam algorithm: check the validity of a first-order logic formula Difference map algorithm general algorithms for the constraint satisfaction
List_of_algorithms
optimization FastICA FP-growth algorithm GeneRec Genetic Algorithm for Rule Set Production Growing self-organizing map ID3 algorithm IDistance k-means++ k-means
List of artificial intelligence algorithms
List_of_artificial_intelligence_algorithms
Image dithering algorithm
Ordered dithering is any image dithering algorithm which uses a pre-set threshold map tiled across an image. It is commonly used to display a continuous
Ordered_dithering
Discrete analog of a derivative
differentiation. The difference operator, commonly denoted Δ {\displaystyle \Delta } (uppercase Delta), is the operator that maps a function f to the function
Finite_difference
Algorithm for phase retrieval
switch algorithm when the error reaches its minimum. Other methods of phasing a coherent diffraction pattern include difference map algorithm and "relaxed
Hybrid_input-output_algorithm
Algorithm for finding shortest paths
Dijkstra's algorithm (/ˈdaɪk.strəz/, DYKE-strəz) is an algorithm for finding the shortest paths between nodes in a weighted graph, which may represent
Dijkstra's_algorithm
Algorithm used for pathfinding and graph traversal
A* (pronounced "A-star") is a graph traversal and pathfinding algorithm that is used in many fields of computer science due to its completeness, optimality
A*_search_algorithm
Recursive algorithm for matrix multiplication
Strassen algorithm, named after Volker Strassen, is an algorithm for matrix multiplication. It is faster than the standard matrix multiplication algorithm for
Strassen_algorithm
Line-drawing algorithm
Bresenham's line algorithm is a line drawing algorithm that determines the points of an n-dimensional raster that should be selected in order to form
Bresenham's_line_algorithm
Web mapping service
problem. Frontier alignments also present some differences between google.cn/maps and google.com/maps. On the latter, sections of the Chinese border with
Google_Maps
Partition into subsets from a given family
Constraint satisfaction problem Dancing Links Difference map algorithm Karp's 21 NP-complete problems Knuth's Algorithm X List of NP-complete problems Partition
Exact_cover
Method of microscopic imaging
Wigner distribution deconvolution (WDD) and iterative methods. The difference map algorithm developed by Thibault and co-workers is available in a downloadable
Ptychography
Overview of and topical guide to machine learning
embedding Temporal difference learning Wake-sleep algorithm Weighted majority algorithm (machine learning) K-nearest neighbors algorithm (KNN) Learning vector
Outline_of_machine_learning
Algorithm to multiply two numbers
multiplication algorithm is an algorithm (or method) to multiply two numbers. Depending on the size of the numbers, different algorithms are more efficient
Multiplication_algorithm
On finding a repeating loop in a sequence
cycle finding is the algorithmic problem of finding a cycle in a sequence of iterated function values. For any function f that maps a finite set S to itself
Cycle_detection
Type of garbage collection algorithm
science, a mark–compact algorithm is a type of garbage collection algorithm used to reclaim unreachable memory. Mark–compact algorithms can be regarded as
Mark–compact_algorithm
Pattern defining an infinite sequence of numbers
solutions of linear difference equations with polynomial coefficients are called P-recursive. For these specific recurrence equations algorithms are known which
Recurrence_relation
Algorithm for caching data
policies (also known as cache replacement algorithms or cache algorithms) are optimizing instructions or algorithms which a computer program or hardware-maintained
Cache_replacement_policies
Data compression approach allowing perfect reconstruction of the original data
the instructions for the decompression map). For a compression algorithm to be lossless, the compression map must form an injection from "plain" to "compressed"
Lossless_compression
Phonetic algorithm for indexing names by sound
representation so that they can be matched despite minor differences in spelling. The algorithm mainly encodes consonants; a vowel will not be encoded unless
Soundex
Subset of artificial intelligence
intelligence concerned with the development and study of statistical algorithms that can learn from data and generalize to unseen data, and thus perform
Machine_learning
Type of image
the noninformative regions. Therefore, retargeting algorithms rely on the availability of saliency maps that accurately estimate all the salient image details
Saliency_map
Field of machine learning
decision process, as many reinforcement learning algorithms use dynamic programming techniques. The main difference between classical dynamic programming methods
Reinforcement_learning
Feature detection algorithm in computer vision
The scale-invariant feature transform (SIFT) is a computer vision algorithm to detect, describe, and match local features in images, invented by David
Scale-invariant feature transform
Scale-invariant_feature_transform
Vector quantization algorithm minimizing the sum of squared deviations
algorithm Centroidal Voronoi tessellation Cluster analysis DBSCAN Head/tail breaks k q-flats k-means++ Linde–Buzo–Gray algorithm Self-organizing map Kriegel
K-means_clustering
Search algorithm finding the position of a target value within a sorted array
half-interval search, logarithmic search, or binary chop, is a search algorithm that finds the position of a target value within a sorted array. Binary
Binary_search
Iterative method for finding maximum likelihood estimates in statistical models
expectation–maximization (EM) algorithm is an iterative method to find (local) maximum likelihood or maximum a posteriori (MAP) estimates of parameters in
Expectation–maximization algorithm
Expectation–maximization_algorithm
GIS analysis operation to evaluate distance
by map projections, the buffer computed this way will not be identical to one drawn on the surface of the Earth; at a local scale, the difference is negligible
Buffer_analysis
Type of data visualization for geographic regions
order, with no intended difference in value. This is most commonly used with nominal categories in a qualitative choropleth map, such as "most prevalent
Choropleth_map
Projection of data onto lower-dimensional manifolds
manifolds was proposed. Relational perspective map is a multidimensional scaling algorithm. The algorithm finds a configuration of data points on a manifold
Nonlinear dimensionality reduction
Nonlinear_dimensionality_reduction
Geometric algorithm
Diffusion maps is a dimensionality reduction or feature extraction algorithm introduced by Coifman and Lafon which computes a family of embeddings of a
Diffusion_map
Algorithm for supervised learning of binary classifiers
In machine learning, the perceptron is an algorithm for supervised learning of binary classifiers. A binary classifier is a function that can decide whether
Perceptron
Overview of and topical guide to algorithms
to algorithms: An algorithm is a finite, well-defined sequence of instructions or rules for solving a problem or performing a computation. Algorithms are
Outline_of_algorithms
Algorithm in a thread whose failure cannot cause another thread to fail
In computer science, an algorithm is called non-blocking if failure or suspension of any thread cannot cause failure or suspension of another thread;
Non-blocking_algorithm
Numerical analysis technique
Maxwell equations by the Chebyshev method: A one-step finite difference time-domain algorithm". IEEE Transactions on Antennas and Propagation. 51 (11): 3155–3160
Finite-difference time-domain method
Finite-difference_time-domain_method
Compact encoding of digital data
vision. For example, small differences in color are more difficult to perceive than are changes in brightness. Compression algorithms can average a color across
Data_compression
Trial and error problem solvers with a metaheuristic or stochastic optimization character
Evolutionary computation (EC) from computer science is a family of algorithms for global optimization inspired by biological evolution, and a subfield
Evolutionary_computation
Methodic assignment of colors to elements of a graph
these algorithms are sometimes called sequential coloring algorithms. The maximum (worst) number of colors that can be obtained by the greedy algorithm, by
Graph_coloring
Computing the fixed point of a function
proof is not constructive. Various algorithms have been devised for computing an approximate fixed point. Such algorithms are used in various tasks, such
Fixed-point_computation
Algorithm to multiply matrices
central operation in many numerical algorithms, much work has been invested in making matrix multiplication algorithms efficient. Applications of matrix
Matrix multiplication algorithm
Matrix_multiplication_algorithm
zero matrix Algorithms for matrix multiplication: Strassen algorithm Coppersmith–Winograd algorithm Cannon's algorithm — a distributed algorithm, especially
List of numerical analysis topics
List_of_numerical_analysis_topics
Technique to compress data
compression. The process of finding or using such a code is Huffman coding, an algorithm developed by David A. Huffman while he was a Sc.D. student at MIT, and
Huffman_coding
Algorithm to approximate functions
The Remez algorithm or Remez exchange algorithm, published by Evgeny Yakovlevich Remez in 1934, is an iterative algorithm used to find simple approximations
Remez_algorithm
Mathematical technique
K(x_{i}-x)\neq 0} . The difference m ( x ) − x {\displaystyle m(x)-x} is called mean shift in Fukunaga and Hostetler. The mean-shift algorithm now sets x ← m (
Mean_shift
Iterative algorithm on numbers
In number theory, Kaprekar’s routine is an iterative algorithm named after its inventor, Indian mathematician D. R. Kaprekar. Each iteration starts with
Kaprekar's_routine
Grouping a set of objects by similarity
Understanding these "cluster models" is key to understanding the differences between the various algorithms. Typical cluster models include: Connectivity models:
Cluster_analysis
Algorithm for measuring similarity between temporal sequences
In time series analysis, dynamic time warping (DTW) is an algorithm for measuring similarity between two temporal sequences, which may vary in speed.
Dynamic_time_warping
Technique for quickly estimating similarity of sets
its intent to also use the algorithm in their newly created FLoC (Federated Learning of Cohorts) system. A hash function maps arbitrary data onto outputs
SimHash
Data visualization technique
a created software algorithm to determine and predict the attention actions of the user. Scroll Tracking: Scroll tracking heat maps are used to represent
Heat_map
Algorithm to estimate signal frequency
A pitch detection algorithm (PDA) is an algorithm designed to estimate the pitch or fundamental frequency of a quasiperiodic or oscillating signal, usually
Pitch_detection_algorithm
About simultaneous modular congruences
the first statement of the theorem), then their difference may be a multiple of N only if x = y. The map x mod N ↦ ( x mod n 1 , … , x mod n k ) {\displaystyle
Chinese_remainder_theorem
Finding strings that approximately match a pattern
In fact, we can use the Levenshtein distance computing algorithm for E(m, j), the only difference being that we must initialize the first row with zeros
Approximate_string_matching
tree algorithms are a class of algorithms for self-balancing binary search trees. This framework aims at designing highly-parallelized algorithms for various
Join-based_tree_algorithms
Reduction of information complexity on maps
set of algorithms, generalization seeks to abstract spatial information at a high level of detail to information that can be rendered on a map at a lower
Cartographic_generalization
Signal representation used in automatic speech recognition
frame-to-frame difference) coefficients. The European Telecommunications Standards Institute in the early 2000s defined a standardised MFCC algorithm to be used
Mel-frequency_cepstrum
Computer vision algorithm
Semi-global matching (SGM) is a computer vision algorithm for the estimation of a dense disparity map from a rectified stereo image pair, introduced in
Semi-global_matching
Technological phenomenon with social implications
Algorithmic bias describes systematic and repeatable harmful tendency in a computerized sociotechnical system to create "unfair" outcomes, such as "privileging"
Algorithmic_bias
Optimization problem in computer science
character recognition Statistical classification – see k-nearest neighbor algorithm Computer vision – for point cloud registration Computational geometry
Nearest_neighbor_search
Machine learning technique useful for dimensionality reduction
including self-organizing maps. Kohonen originally proposed random initiation of weights. (This approach is reflected by the algorithms described above.) More
Self-organizing_map
Mathematical optimization problem restricted to integers
Branch and bound algorithms have a number of advantages over algorithms that only use cutting planes. One advantage is that the algorithms can be terminated
Integer_programming
Lossless data compression
Pérez Suárez, Airel; Feregrino-Uribe, Claudia (2010). "A Compression Algorithm for Mining Frequent Itemsets" (PDF). New Trends in Electrical Engineering
PackBits
Primal-Dual algorithm optimization for convex problems
In mathematics, the Chambolle–Pock algorithm is an algorithm used to solve convex optimization problems. It was introduced by Antonin Chambolle and Thomas
Chambolle–Pock_algorithm
Artificial neural network algorithm
learning rule or learning process is a method, mathematical logic or algorithm which improves the network's performance and/or training time. Usually
Learning_rule
Mathematical term
in mathematics: Gradient descent, a first-order iterative optimization algorithm for finding the minimum of a function Gradient theorem, theorem that a
Slope
Image edge detection algorithm
Canny edge detector is an edge detection operator that uses a multi-stage algorithm to detect a wide range of edges in images. It was developed by John F
Canny_edge_detector
Method of estimating the parameters of a statistical model
reparameterization. As an example of the difference between Bayes estimators mentioned above (mean and median estimators) and using a MAP estimate, consider the case
Maximum a posteriori estimation
Maximum_a_posteriori_estimation
Automatic detection of the type of an expression in a formal language
and relabeling gives us map :: (a -> b) -> [a] -> [b], the same as we found without going into these details. The algorithm first used to perform type
Type_inference
Function that maps the colors of one image to the colors of another image
that maps (transforms) the colors of one (source) image to the colors of another (target) image. A color mapping may be referred to as the algorithm that
Image_color_transfer
Paradigm in machine learning that uses no classification labels
framework in machine learning where, in contrast to supervised learning, algorithms learn patterns exclusively from unlabeled data. Other frameworks in the
Unsupervised_learning
Set of methods for supervised statistical learning
vector networks) are supervised max-margin models with associated learning algorithms that analyze data for classification and regression analysis. Developed
Support_vector_machine
Algorithm for virtual memory implementation
behavior of applications. Requirements for page replacement algorithms have changed due to differences in operating system kernel architectures. In particular
Page_replacement_algorithm
Process of reducing words to word stems
usually sufficient that related words map to the same stem, even if this stem is not in itself a valid root. Algorithms for stemming have been studied in
Stemming
Type of raster image in computer graphics
from each other, there is still a small difference in the terms. Heightmap comes from the mathematical term 'map' and heightfield comes from the mathematical
Heightmap
Partitioning a digital image into segments
value as well as difference in pixel label when compared to labels of neighboring pixels. The iterated conditional modes (ICM) algorithm tries to reconstruct
Image_segmentation
Numerical eigenvalue calculation
The Lanczos algorithm is an iterative method devised by Cornelius Lanczos that is an adaptation of power methods to find the m {\displaystyle m} "most
Lanczos_algorithm
automorphism to the coefficients. This algorithm works also over a field of characteristic zero, with the only difference that it never enters in the blocks
Factorization of polynomials over finite fields
Factorization_of_polynomials_over_finite_fields
Optimization algorithm for artificial neural networks
"reverse mode"). The goal of any supervised learning algorithm is to find a function that best maps a set of inputs to their correct output. The motivation
Backpropagation
Texturing technique for bumps/wrinkles in computer graphics
The algorithm also ensures that the surface appearance changes as lights in the scene are moved around. The other method is to specify a normal map which
Bump_mapping
Data clustering algorithm
Hartigan: Clustering Algorithms, John Wiley & Sons, Inc., 1975 Volunteered Geographic Information, Daniel Lewis, Jenks Natural Breaks Algorithm with an implementation
Jenks natural breaks optimization
Jenks_natural_breaks_optimization
Greatest common divisor of polynomials
of the loop. It is therefore called extended GCD algorithm. Another difference with Euclid's algorithm is that it also uses the quotient, denoted "quo"
Polynomial greatest common divisor
Polynomial_greatest_common_divisor
Digital signature scheme
In public-key cryptography, Edwards-curve Digital Signature Algorithm (EdDSA) is a digital signature scheme using a variant of Schnorr signature based
EdDSA
Robotics algorithm
filter localization, is an algorithm for robots to localize using a particle filter. Given a map of the environment, the algorithm estimates the position
Monte_Carlo_localization
Algorithms and methods of plotting the Mandelbrot set on a computing device
These programs use a variety of algorithms to determine the color of individual pixels efficiently. The simplest algorithm for generating a representation
Plotting algorithms for the Mandelbrot set
Plotting_algorithms_for_the_Mandelbrot_set
Volume rendering technique
and density control of the Gaussians. A fast visibility-aware rendering algorithm supporting anisotropic splatting is also proposed, catering to GPU usage
Gaussian_splatting
Image edge detection algorithm
image processing and computer vision, particularly within edge detection algorithms where it creates an image emphasizing edges. It is named after Irwin Sobel
Sobel_operator
Formatted data in computer science
data structures. Another Haskell library "stm-containers" adapts the algorithm for use in the context of software transactional memory. A JavaScript
Hash_array_mapped_trie
Systematic representation of the surface of a sphere or ellipsoid onto a plane
the parallels can be placed according to any algorithm the designer has decided suits the needs of the map. The famous Mercator projection is one in which
Map_projection
Field of mathematics and science based on non-linear systems and initial conditions
(August 2014). "Cryptanalyzing a RGB image encryption algorithm based on DNA encoding and chaos map". Optics & Laser Technology. 60: 111–115. arXiv:1307
Chaos_theory
Curve along which a 3-D surface is at equal elevation
steepness or gentleness of slopes. The contour interval of a contour map is the difference in elevation between successive contour lines. The gradient of the
Contour_line
Method of defining surface detail on a computer-generated graphic or 3D model
texture map), (2) applying a 2D texture map onto the surface of a 3D model, and (3) the 3D software algorithm that performs both tasks. A texture map refers
Texture_mapping
Scatter plot of several countries's societies
"Truly modelling reality...? - Let's improve our cognitive maps with a bastard mix of algorithms to "undo" pictures, isometric mapping, high-density diagrams
Inglehart–Welzel cultural map of the world
Inglehart–Welzel_cultural_map_of_the_world
NP-hard problem in combinatorial optimization
problems. Thus, it is possible that the worst-case running time for any algorithm for the TSP increases superpolynomially (but no more than exponentially)
Travelling_salesman_problem
Random search tree data structure
while the difference function should return the empty set. Let d be the size of the symmetric difference. The modified merge algorithms will then also
Treap
Software library for the C++ programming language
into the C++ standard library itself. It provides four components called algorithms, containers, functors, and iterators. The STL provides a set of common
Standard_Template_Library
Data structure used for indexing spatial information
resulting pages are much more useful for common map applications. The R*-tree uses the same algorithm as the regular R-tree for query and delete operations
R*-tree
Computer graphics technique
concept that also includes displacement based on a texture map. Renderers using the REYES algorithm, or similar approaches based on micropolygons, have allowed
Displacement_mapping
Restrictions on using GPS in China
Dìxíng tú fēixiànxìng bǎomì chǔlǐ suànfǎ; lit. 'Topographic map non-linear confidentiality algorithm') is a geodetic datum used by the Chinese State Bureau
Restrictions on geographic data in China
Restrictions_on_geographic_data_in_China
Image processing technique
were used to predict color appearance. Despite this, if algorithms could not sufficiently map tones and colors, a skilled artist was still needed, as
Tone_mapping
Iterative method in conformal mapping
Dirichlet problem must be solved jointly on the two subdomains. An iterative algorithm is introduced: Make a first guess of the solution on the circle's boundary
Schwarz_alternating_method
DIFFERENCE MAP-ALGORITHM
DIFFERENCE MAP-ALGORITHM
Girl/Female
American, Australian, Danish, French, German, Greek, Hebrew, Japanese, Scottish, Swedish, Thai, Vietnamese
May; Goddess of Spring Growth; Brightness; Dance; Coyote; Pearl; Cherry Blossom; Apricot Blossom; Combination of Ma and Ai; Scottish Form of Margaret
Girl/Female
Arabic, Muslim
Distinction; Difference; Manner
Female
Vietnamese
 Vietnamese name MAI means "golden flower." Compare with another form of Mai.
Male
English
Variant spelling of English Matt, MAT means "gift of God."
Male
Hebrew
Short form of Hebrew Immanuw'el (English Immanuel), MAN means "God is with us."
Male
Egyptian
, Divine Father.
Female
English
 Possibly an Anglicized form of Irish Gaelic Meadhbh, MAB means "intoxicating." Short form of English Mabel, meaning "lovable."
Male
Egyptian
, a chief of boatmen.
Female
Japanese
(舞) Japanese name MAI means "dance." Compare with another form of Mai.
Surname or Lastname
Japanese
Japanese : ‘front’ or ‘before’; not common in Japan. Some occurrences in America could be shortened versions of longer names beginning with this element.Hawaiian : unexplained.English : variant of May.
Surname or Lastname
English
English : nickname for a clever or cunning person, from Middle English yap ‘devious’, ‘deceitful’, ‘bent’; ‘shrewd’.Americanized spelling of North German Japp.Chinese : variant of Ye.Filipino : unexplained.
Surname or Lastname
English
English : from a variant of the medieval female personal name Mab(be), a short form of Middle English, Old French Amabel (from Latin amabilis ‘loveable’). This has survived into the 20th century in the short form Mabel.English : possibly from an unattested Old English male personal name, Mappa.English : from Old Welsh map, mab ‘son’, which was used as a distinguishing epithet.
Boy/Male
Gaelic
Son of the handsome man.
Female
English
Variant spelling of English May, a pet form of Margaret, MAE means "pearl," and Mary, meaning "obstinacy, rebelliousness" or "their rebellion."
Female
Polish
Polish form of Greek Margarites, MAÅGORZATA means "pearl."
Female
English
Short form of English Maggie, MAG means "pearl."
Surname or Lastname
Ukrainian, Jewish (from Ukraine), Polish, Serbian, and Hungarian (Cáp)
Ukrainian, Jewish (from Ukraine), Polish, Serbian, and Hungarian (Cáp) : from Ukrainian tsap ‘billy goat’, Polish cap, and so probably a nickname for someone thought to resemble the animal in some way or perhaps a metonymic occupational name for a goat herd.Czech (Čáp) : nickname for a tall or long-legged man, from Äáp ‘stork’.Southern French : from Occitan cap ‘head’ (Latin caput); probably a nickname for a person with something distinctive about his head. The word was often used in the metaphorical sense ‘chief’, ‘principal’, and the surname may also have denoted a leader or a village elder. In some cases it may also be a topographic name from the same word used in the sense of a promontory or headland.Americanized spelling of German Kapp.English : variant spelling of Capp.
Surname or Lastname
English, French, Danish, Dutch, and German
English, French, Danish, Dutch, and German : from a short form of the personal name Matthias (see Matthew) or any of its many cognates, for example Norman French Maheu.English, French, Dutch, and German : from a nickname or personal name taken from the month of May (Middle English, Old French mai, Middle High German meie, from Latin Maius (mensis), from Maia, a minor Roman goddess of fertility). This name was sometimes bestowed on someone born or baptized in the month of May; it was also used to refer to someone of a sunny disposition, or who had some anecdotal connection with the month of May, such as owing a feudal obligation then.English : nickname from Middle English may ‘young man or woman’.Irish (Connacht and Midlands) : when not of English origin (see 1–3 above), this is an Anglicized form of Gaelic Ó Miadhaigh ‘descendant of Miadhach’, a personal name or byname meaning ‘honorable’, ‘proud’.French : habitational name from any of various places called May or Le May.Jewish (Ashkenazic) : habitational name from Mayen, a place in western Germany.Americanized spelling of cognates of 1 in various European languages, for example Swedish Ma(i)j.Chinese : possibly a variant of Mei 1, although this spelling occurs more often for the given name than for the surname.Cape May, at the mouth of Delaware Bay, is named after the Dutch explorer Cornelius Jacobsen May.
Girl/Female
American, Anglo, Australian, British, Chinese, Christian, English, French, German, Greek, Hebrew, Japanese
The Fifth Month of the Year; Kinswomen; May; The Month May was Goddess of Spring Growth; Bitter; Pearl; Beloved
Boy/Male
Hindu, Indian
Difference
DIFFERENCE MAP-ALGORITHM
DIFFERENCE MAP-ALGORITHM
Girl/Female
Muslim
Diminutive of Jumana, Small
Girl/Female
Australian, Biblical
Young Girl
Biblical
for him, mercy
Boy/Male
Tamil
Shivaji raje
Girl/Female
Tamil
kaninika | காநீநீகா
Eyeball
Boy/Male
Native American
bowl.
Girl/Female
Tamil
A folk heroine
Female
Bulgarian
(СофиÑ), wisdom.
Boy/Male
Muslim
Scholar. LittTrateur.
Girl/Female
Hindu, Indian
A Small Star
DIFFERENCE MAP-ALGORITHM
DIFFERENCE MAP-ALGORITHM
DIFFERENCE MAP-ALGORITHM
DIFFERENCE MAP-ALGORITHM
DIFFERENCE MAP-ALGORITHM
n.
Absence of anxiety or interest in respect to what is presented to the mind; unconcernedness; as, entire indifference to all that occurs.
v. t.
To rub or wipe with a mop, or as with a mop; as, to mop a floor; to mop one's face with a handkerchief.
imp. & p. p.
of Difference
v. t.
To represent by a map; -- often with out; as, to survey and map, or map out, a county. Hence, figuratively: To represent or indicate systematically and clearly; to sketch; to plan; as, to map, or map out, a journey; to map out business.
v. t.
To cover with a cap, or as with a cap; to provide with a cap or cover; to cover the top or end of; to place a cap upon the proper part of; as, to cap a post; to cap a gun.
n.
Difference of quality or property in different directions.
n.
Estimation of difference; regard to differences or distinguishing circumstance.
v. t.
To deprive of cap.
v. t.
To feed with pap.
v. t.
To rest or recline in a lap, or as in a lap.
n.
Anything growing thickly, or closely interwoven, so as to resemble a mat in form or texture; as, a mat of weeds; a mat of hair.
n.
A large size of writing paper; as, flat cap; foolscap; legal cap.
v. t.
To cause to differ; to make different; to mark as different; to distinguish.
n.
Anything which represents graphically a succession of events, states, or acts; as, an historical map.
a.
Of various or contrary nature, form, or quality; partially or totally unlike; dissimilar; as, different kinds of food or drink; different states of health; different shapes; different degrees of excellence.
v. i.
To be mad; to go mad; to rave. See Madding.
n.
The merrymaking of May Day.
n.
The act of differing; the state or measure of being different or unlike; distinction; dissimilarity; unlikeness; variation; as, a difference of quality in paper; a difference in degrees of heat, or of light; what is the difference between the innocent and the guilty?
v. t.
To strike with a slight or gentle blow; to touch gently; to rap lightly; to pat; as, to tap one with the hand or a cane.
n.
The quality or state of being indifferent, or not making a difference; want of sufficient importance to constitute a difference; absence of weight; insignificance.