a `` Double-Figure '', which went to the Chicago Art Institute, and is considered by him the most successful of his abstracts ; ;

nor is there need to add that among them are some of the most highly individualized and most successful of his characters.

For him Mercer produced the lyric to `` Out Of Breath Scared To Death Of You '', introduced in that most successful of all the Gaieties, by Sterling Holloway.

In other words, as students go through college, those who are most successful academically tend to become more committed to a `` Bill of Rights '' orientation.

For example, even the most successful executive lives in a two-room apartment while ordinary people rent space in the stairwells of office buildings in which to sleep at night ; ;

That first entry there is the Vermont Flumenophobe, the earliest and one of the most successful of my eighty-three varieties -- great big scapulars and hardly any primaries at all.

A true university, like most successful marriages, is a unity of diversities Without forcing all components into a single pattern, the preparation of a master plan is an opportunity to consider interrelation of knowledge at its highest level, which a university -- in contrast to a multiversity -- should stand for.

My heart was not in it, but, oddly enough, it remains the most financially successful picture of my career.

Moreover, the most artistically successful of the nonfiction films have invariably borrowed the narrative form from the fiction feature.

The Thrift Shop, with Mrs. Bernhard S. Blumenthal as president, is one of the city's most successful fund-raisers for the Federation of Jewish Agencies.

Highly successful in England before its transfer to New York, most of `` Roots '' is as relentlessly dour as the trappings of the small new theater are gaudy.

Even English has general, albeit complex, rules that predict pronunciation from spelling, and these rules are successful most of the time ; rules to predict spelling from the pronunciation have a higher failure rate.

Alumni was the most successful team in the amateur era of Argentine football, winning 10 of the 14 league championships contested, being considered the first great football team.

The most successful of these patent anchors, the Trotman Anchor, introduced a pivot where the arms join the shank, allowing the " idle " arm to fold against the shank.

The experimental community was never successful, partly because most of the land was not arable.

In the sense that most modern languages are " algol-like ", it was arguably the most successful of the four high level programming languages with which it was roughly contemporary, Fortran, Lisp, and COBOL.

From an artistic point of view, he was most successful in portrait-statues and groups of children, where he was obliged to follow nature most closely.

Though the period of his caliphate was not long, it included successful invasions of the two most powerful empires of the time, a remarkable achievement in its own right.

Although early Commodore advertisements attempted to cast the computer as an all-purpose business machine, the Amiga was most commercially successful as a home computer, with a wide range of games and creative software.

Future suicide hijackers most likely will encounter greater resistance from passengers and flight crews, making another successful hijacking more unlikely.

The most successful Zeppelin was the Graf Zeppelin.

One of the most successful designs of this period was the Douglas DC-3, which became the first airliner that was profitable carrying passengers exclusively, starting the modern era of passenger airline service.

On any given run of the algorithm, it has a probability of at most 1 / 3 that it will give the wrong answer.

Huffman coding is the most known algorithm for deriving prefix codes, so prefix codes are also widely referred to as " Huffman codes ", even when the code was not produced by a Huffman algorithm.

They are widely conjectured to be most vulnerable to Grover's algorithm.

" Difficult ", in this sense, is described in terms of the computational resources needed by the most efficient algorithm for a certain problem.

( Earley's original algorithm included a look-ahead in the state ; later research showed this to have little practical effect on the parsing efficiency, and it has subsequently been dropped from most implementations.

The FFT has been described as " the most important numerical algorithm of our lifetime ".

By far the most commonly used FFT is the Cooley – Tukey algorithm.

The most well-known use of the Cooley – Tukey algorithm is to divide the transform into two pieces of size at each step, and is therefore limited to power-of-two sizes, but any factorization can be used in general ( as was known to both Gauss and Cooley / Tukey ).

Although the basic idea is recursive, most traditional implementations rearrange the algorithm to avoid explicit recursion.

In most cases this scanline algorithm is at least an order of magnitude faster than the per-pixel one.

It is known for its use of the Hindley – Milner type inference algorithm, which can automatically infer the types of most expressions without requiring explicit type annotations.

The most widely used learning algorithms are Support Vector Machines, linear regression, logistic regression, naive Bayes, linear discriminant analysis, decision trees, k-nearest neighbor algorithm, and Neural Networks ( Multilayer perceptron ).

* Asymptotically optimal algorithm, an algorithm that is at most a constant factor worse than the best possible algorithm for large input sizes

In particular, most of the popular public key ciphers are based on the difficulty of factoring integers ( or the related discrete logarithm problem, which can also be solved by Shor's algorithm ), including forms of RSA.

The most well-known example of this is quantum database search, which can be solved by Grover's algorithm using quadratically fewer queries to the database than are required by classical algorithms.

The software implementation of the SuperMemo algorithm in its most rudimentary and basic form is a database of question and answer ( Q & A ) fields ( or more practically, digital and electronic flashcards ).

The choice of embedding algorithm in the most cases is driven by the results of the steganographic channel robustness analysis.

This algorithm makes it easier to use SNOBOL as a logic programming language than is the case for most languages.

In the special case that distances between cities are all either one or two ( and thus the triangle inequality is necessarily satisfied ), there is a polynomial-time approximation algorithm that finds a tour of length at most 8 / 7 times the optimal tour length.

It is known that, unless P = NP, there is no polynomial-time algorithm that finds a tour of length at most 220 / 219 = 1. 00456 … times the optimal tour's length.

In the case of bounded metrics it is known that there is no polynomial time algorithm that constructs a tour of length at most 321 / 320 times the optimal tour's length, unless P = NP.

In general, for any c > 0, where d is the number of dimensions in the Euclidean space, there is a polynomial-time algorithm that finds a tour of length at most ( 1 + 1 / c ) times the optimal for geometric instances of TSP in time ; this is called a polynomial-time approximation scheme ( PTAS ).