[permalink] [id link]
Consider the following: if the typical user is searching with term " A ", would they also want resources tagged with term " B "?
from
Wikipedia
Some Related Sentences
Consider and following
Consider the following reactions of acetic acid ( CH < sub > 3 </ sub > COOH ), the organic acid that gives vinegar its characteristic taste:
Consider for example determining which of the following are to be considered diseases ( i. e., abnormal states requiring cure ): alcoholism, homosexuality, and chronic fatigue syndrome.
Consider the following examples, created using animated GIFs, wherein a key frame defines the starting and ending points of any smooth transition:
Consider the case in which liquid crystal molecules are aligned parallel to the surface and an electric field is applied perpendicular to the cell as in the following diagram.
Consider the following example ( in Kwakw ' ala, sentences begin with what corresponds to an English verb ):
Suppose that U: D → C is a functor from a category D to a category C, and let X be an object of C. Consider the following dual ( opposite ) notions:
Consider and if
* Consider the set of all functions from the real number line to the closed unit interval, and define a topology on so that a sequence in converges towards if and only if converges towards for all.
* Consider the modulo 2 equivalence relation on the set of integers: if and only if their difference is an even number.
Consider some set P and a binary relation ≤ on P. Then ≤ is a preorder, or quasiorder, if it is reflexive and transitive, i. e., for all a, b and c in P, we have that:
Consider an audio DSP example: if a process requires 2. 01 seconds to analyze, synthesize, or process 2. 00 seconds of sound, it is not real-time.
Consider a system in which voters can vote for any candidate from any one of many parties ; suppose further that if a party gets 15 % of votes, then that party will win 15 % of the seats in the legislature.
Consider a jar containing N lottery tickets numbered from 1 through N. If you pick a ticket randomly then you get positive integer n, with probability 1 / N if n ≤ N and with probability zero if n > N. This can be written
Consider the implication " if I am in Massachusetts, then I am in North America ", which we might alternatively express as, " if I were in Massachusetts, then I would be in North America ".
Consider the ( possibly proper ) class B defined such for every set y, y is in B if and only if there is an x in A with F < sub > P </ sub >( x ) = y.
We say that the number x is a periodic point of period m if f < sup > m </ sup >( x ) = x ( where f < sup > m </ sup > denotes the composition of m copies of f ) and having least period m if furthermore f < sup > k </ sup >( x ) ≠ x for all 0 < k < m. We are interested in the possible periods of periodic points of f. Consider the following ordering of the positive integers:
Writing in 1960, he begins: " Consider a very long sequence of symbols ... We shall consider such a sequence of symbols to be ' simple ' and have a high a priori probability, if there exists a very brief description of this sequence-using, of course, some sort of stipulated description method.
Consider the example above where the spring rate was calculated to be 500 lbs / inch, if you were to move the wheel ( without moving the car ), the spring more than likely compresses a smaller amount.
Consider a raffle where a single ticket wins a prize of all entry fees: if the prize is $ 1, the entry fee will be 1 / number of tickets.
The Voltage Regulation formula could be visualized with the following ; " Consider power being delivered to a load such that the voltage at the load is the load's rated voltage V < sub > Rated </ sub >, if then the load disappears, the voltage at the point of the load will rise to V < sub > nl </ sub >.
Consider the circuit minimization problem: given a circuit A computing a Boolean function f and a number n, determine if there is a circuit with at most n gates that computes the same function f. An alternating Turing machine, with one alternation, starting in an existential state, can solve this problem in polynomial time ( by guessing a circuit B with at most n gates, then switching to a universal state, guessing an input, and checking that the output of B on that input matches the output of A on that input ).
Consider a SISO system with states ( see state space for details about MIMO systems ), if the row rank of the following observability matrix
0.498 seconds.