Search results
Jump to navigation
Jump to search
Page title matches
- ...after the [[key signature]] in a piece of [[music]]. The two numbers in a time signature tell you how many of one kind of [[note (music)|note]] there are == Finding out what certain time signatures mean == ...3 KB (480 words) - 10:12, 20 June 2016
- ...n [[Albert Einstein]]'s theories of [[relativity]], there are two types of time dilation: <ref>Einstein, Albert and Infeld, Leopold 1938. ''The evolution o Experiments support both aspects of time dilation.<ref>{{cite book|last=Blaszczak Z. 2007|title=Laser 2006|url=https ...4 KB (681 words) - 09:08, 18 February 2017
- ...quickly but requires more memory than you have, you can try to spend more time solving the problem in the limited memory. ...writing down anything, which uses very little space, but might take a long time. ...3 KB (482 words) - 01:39, 25 October 2013
- = Mixing Time = The '''mixing time''' of a Markov chain gives the rate at which a Markov chain converges to th ...3 KB (562 words) - 13:56, 10 August 2011
- For any <math>u,v\in V</math>, the '''hitting time''' <math>\tau_{u,v}</math> is the expected number of steps before vertex <m This fact can be used to estimate the hitting time between two adjacent vertices. ...3 KB (510 words) - 15:06, 19 July 2011
- = Mixing Time= The '''mixing time''' of a Markov chain gives the rate at which a Markov chain converges to th ...27 KB (4,881 words) - 13:52, 31 July 2013
- = Mixing Time= The '''mixing time''' of a Markov chain gives the rate at which a Markov chain converges to th ...27 KB (4,881 words) - 07:04, 2 June 2014
- = Mixing Time= The '''mixing time''' of a Markov chain gives the rate at which a Markov chain converges to th ...23 KB (4,166 words) - 05:41, 22 December 2015
Page text matches
- ...after the [[key signature]] in a piece of [[music]]. The two numbers in a time signature tell you how many of one kind of [[note (music)|note]] there are == Finding out what certain time signatures mean == ...3 KB (480 words) - 10:12, 20 June 2016
- ...e <math>2\pi</math> encompassing one orbit is simply equal to ratio of the time of flight to the [[orbit]]al [[orbital period|period]] of one whole orbit ( ...846 bytes (137 words) - 09:46, 20 October 2014
- ...的检验结果的正确性，则poly-time monte carlo algorithm可以通过反复“尝试-验证”的方法转换为expected poly-time las vegas algorithm。 ...2 KB (77 words) - 01:17, 29 April 2010
- ...quickly but requires more memory than you have, you can try to spend more time solving the problem in the limited memory. ...writing down anything, which uses very little space, but might take a long time. ...3 KB (482 words) - 01:39, 25 October 2013
- ...fined as the [[integral]] of a [[Force (physics)|force]] with respect to [[time]]: : ''dt'' shows it is with respect to time. ...1 KB (158 words) - 00:15, 11 February 2016
- ...he distance the object travelled [[Division (mathematics)|divided]] by the time. where <math>d</math> is the distance and <math>t</math> is the time that has gone by. ...1 KB (195 words) - 08:01, 30 March 2017
- For any <math>u,v\in V</math>, the '''hitting time''' <math>\tau_{u,v}</math> is the expected number of steps before vertex <m This fact can be used to estimate the hitting time between two adjacent vertices. ...3 KB (510 words) - 15:06, 19 July 2011
- ...r example swinging from left to right and back to left. We will call this time T. If the pendulum length is ''L'', and the acceleration of gravity is g, t The regular motion of the pendulum can be used for time keeping, and pendulums are used to regulate pendulum [[clock]]s. ...1 KB (200 words) - 23:05, 20 March 2017
- = Mixing Time = The '''mixing time''' of a Markov chain gives the rate at which a Markov chain converges to th ...3 KB (562 words) - 13:56, 10 August 2011
- '''Big O Notation''' is a way of saying how much time it takes for a mathematical [[algorithm]] to run or how much [[computer mem ...hardware specifications and may produce the answer in different amounts of time should any program be run on them. The Big O notation, on the other hand, r ...4 KB (700 words) - 14:03, 20 September 2015
- ...n [[Albert Einstein]]'s theories of [[relativity]], there are two types of time dilation: <ref>Einstein, Albert and Infeld, Leopold 1938. ''The evolution o Experiments support both aspects of time dilation.<ref>{{cite book|last=Blaszczak Z. 2007|title=Laser 2006|url=https ...4 KB (681 words) - 09:08, 18 February 2017
- The '''wavelet transform''' is a [[time]]-[[frequency]] representation of a [[signal processing|signal]]. For examp * <math>b</math> denotes time shift of wavelet and ...2 KB (317 words) - 16:57, 23 January 2015
- ...four dimensions: three dimensions of space (x, y, z) and one dimension of time. Minkowski spacetime has a metric signature of (-+++) and is always flat. T ...s of the speed of light times the time coordinate is so that the units for time are the same as the units for space. Spacetime has the differential for arc ...3 KB (486 words) - 17:18, 1 September 2016
- The '''Lorentz factor''' is the factor by which time, length, and [[mass]] changes in for an object moving at speeds close to th == Time dilation == ...3 KB (527 words) - 04:29, 31 March 2017
- ...riable <math>X</math> (think that <math>X</math> is a cost such as running time of a randomized algorithm). We call this a '''tail bound''', or a '''tail i ...ed algorithm for a decision problem <math>f</math>, whose expected running time is within <math>T(n)</math> on any input of size <math>n</math>. We transfo ...3 KB (541 words) - 15:18, 21 July 2011
- ...nic motion''. When measuring motion, it is normal to make a [[graph]] with time on one axis and distance on the other. Sometimes, when something moves its ...ude]] is the biggest distance from the fixed point. The [[period]] is the time the weight takes to get back to the same point again (with the same speed a ...2 KB (431 words) - 21:21, 22 August 2017
- ...uote><math display="block">\text{velocity} = \frac\text{displacement}\text{time}</math></blockquote>For example, if an object moves 20 meters (m) to the le ...1 KB (172 words) - 21:31, 13 February 2017
- ...d the time for planet 1 to cover segment ''A''<sub>1</sub> is equal to the time to cover segment ''A''<sub>2</sub>. <br><br> (3) The total orbit times for ...ning a planet and the Sun sweeps out equal areas during equal intervals of time. ...3 KB (498 words) - 22:12, 30 May 2017
- ...ath>. And the following theorem is implied by the upper bound on the cover time. : USTCON can be solved by a polynomial time Monte Carlo randomized algorithm with bounded one-sided error, which uses < ...3 KB (468 words) - 10:48, 29 December 2011
- ...st problems in NP (they are [[NP-hardness|NP-hard)]]. People spent lots of time looking for algorithm that finds answers to some NP-complete problem in pol The unsolved problem [[P versus NP|P = NP]] asks whether polynomial time algorithms actually exist for NP-complete, and by corollary, all NP problem ...1 KB (208 words) - 12:39, 30 December 2016
- ...题目中 complete 一词改为 hard。本题需要证明任何一个非空也非<math>\{0,1\}^*</math>的语言在 polynomial-time Karp reduction 下<font color=red><strong>都</strong></font>是 NL-hard，也就是证明<ma ...772 bytes (53 words) - 00:41, 24 October 2019
- ...d in [[Physics]] that says that the amount of something does not change in time. That thing could be as simple as [[mass]] or [[charge]], or something that For a long time, people thought that these laws were true for the amount of mass and [[ener ...3 KB (575 words) - 23:22, 28 November 2015
- ...[[Geiger-Muller detector]] can be used to measure the half-life; it is the time when the activity is half of the original. ...gain, it will be seen that the atom decays within the half life 50% of the time. ...3 KB (407 words) - 04:36, 7 May 2013
- # Give a poly-time greedy algorithm for finding the weighted max <math>k</math>-cut. Prove tha ::Fill in the blank parenthesis. Give an analysis of the running time of the algorithm. And prove that the approximation ratio is 0.5. ...3 KB (460 words) - 08:16, 25 October 2017
- ...})</math>. The naive algorithm will take asymptotically the same amount of time. ...andomized algorithm, due to Freivalds, running in only <math>O(n^2)</math> time: ...4 KB (694 words) - 03:25, 23 July 2011
- The accelerating electric field reverses just at the time the electrons finish their half circle, so that it accelerates them across ...n a circular path under the influence of a constant magnetic field. If the time to complete one orbit is calculated: ...2 KB (311 words) - 06:34, 12 March 2017
- ...f [[control theory]] to represent a signal that switches on at a specified time and stays switched on indefinitely. It was named after the [[England|Englis The discrete-time unit impulse is the first difference of the discrete-time step ...2 KB (319 words) - 20:50, 20 March 2013
- *"t" is [[time]]. *"n(t)" is the rate of earthquakes in a time after the main shock ...1 KB (210 words) - 13:22, 11 March 2013
- ...e change of velocity [[Division (mathematics)|divide]]d by the change of [[time]]. Acceleration is a [[vector]], and therefore includes both a [[size]] and :<math>t_0</math> is the time at the start ...4 KB (606 words) - 07:19, 25 August 2016
- ...math>Y_t</math> denote the sum of the degrees of all the white vertices at time <math>t</math>. Show that <math>Y_t</math> is a martingale with respect to * Design an efficient, time reversible, ergodic random walk on <math>G</math> whose stationary distribu ...4 KB (631 words) - 04:02, 2 August 2013
- ...ks an action <math>A_t</math> based on a policy <math>\pi</math>. The next time step, the agent receives a reward signal <math>R_{t+1}</math> and a new obs ...3 KB (519 words) - 01:25, 5 April 2017
- ...is used most of the time, for most of the things we can see. Some of the time, for example when the things are too small, classical mechanics is not good #::t is time - how long the object was accelerated for. ...9 KB (1,483 words) - 20:40, 29 October 2016
- ...ath>q</math> be some nonnegative reals with <math>p+q\le 1</math>. At each time step, exactly one of the following occurs. ...stationary distribution is <math>\pi</math>. Prove that the random walk is time-reversible, irreducible, aperiodic, and has stationary distribution <math>\ ...3 KB (555 words) - 12:38, 19 May 2010
- ...on which tells how the concentration of reagents and products changes with time is found. So, a plot of <math>\ln{[A]}</math> against time ''t'' gives a straight line with a slope of <math>-k</math>. ...2 KB (278 words) - 16:34, 20 February 2017
- ...ick lift requires more power. This means the work can be done in a shorter time if there is more power available. :''t'' is [[time]]. ...1 KB (246 words) - 16:49, 16 January 2017
- In this lecture, we are focused on the '''time complexity''', although there are other complexity measures in various comp ...the (worst-case) time complexity of <math>A</math> is the maximum running time over all inputs <math>x</math> of length <math>n</math>. ...11 KB (1,828 words) - 06:00, 27 August 2011
- ...scharge describes how much [[water]] flows through, in a certain amount of time. The amount is usually expressed in <math>\frac{m^3}{s}</math> ([[cubic met ...442 bytes (64 words) - 05:01, 15 March 2017
- |+ Table 1: ''Time taken (in seconds) to answer a simple math question'' ...the largest was 34 seconds. One method we could use to analyze the needed time is to group close numbers together. In order to keep the analysis fair, we' ...3 KB (462 words) - 22:41, 18 October 2014
- *'''Time''': every Thursday, 6:30pm. ...; potential analysis; <br>Knapsack; dynamic programming; pseudo-polynomial time; scale and round; FPTAS.||Chap. 2.6, 3.1 of<br>Williamson-Shmoys. ...4 KB (455 words) - 07:53, 28 December 2011
- ...[convection]]. Usually more than one of these processes happen at the same time. ...conduction''', also known as '''Fourier's law''', means that the rate, in time, of heat transfer through a material is [[Proportionality|proportional]] to ...3 KB (414 words) - 07:43, 16 June 2017
- ...[magnetic energy]]) is no longer [[constant]]. Instead, it decreases with time as [[energy]] is transferred to [[thermal energy]] in the resistance. Becau ...es that <math>U</math> decreases. By differentiating Eq. 1 with respect to time and then substituting the result in Eq. 2, the following is obtained: ...2 KB (282 words) - 23:05, 31 May 2017
- The class '''BPP''' (for Bounded-error Probabilistic Polynomial time) is defined as follows: ...ave a randomized algorithm <math>A</math> running in worst-case polynomial time such that for any input <math>x</math>, ...5 KB (842 words) - 01:10, 30 March 2010
- ...r programming by moving from vertex to vertex of the convex polytope, each time making some progress towards optimizing the objective function. Eventually ...al pivoting rule proposed by Dantzig has an exponentially large worst-case time complexity (though works very good in practice). To-date, it is still unkno ...6 KB (1,029 words) - 09:37, 6 November 2011
- ...calculate the [[frequency]] [[spectrum]] of a [[signal]] that changes over time. This kind of [[signal processing]] has many uses such as [[cryptography]], ...parated. In the audio example above, looking at the signal with respect to time does not make it obvious that the notes A, B, and C are in the signal. Many ...3 KB (471 words) - 16:51, 26 March 2017
- # Give a poly-time greedy algorithm for finding the weighted max <math>k</math>-cut. Prove tha ::Fill in the blank parenthesis. Give an analysis of the running time of the algorithm. And prove that the approximation ratio is 0.5. ...5 KB (927 words) - 04:53, 12 October 2016
- [[Category:Time]] ...521 bytes (75 words) - 17:34, 20 October 2015
- ...on can be thought of as a picture of how this particle or system acts with time and describes it as fully as possible. ...t positions, energies, velocities or other physical properties at the same time (i.e. "be in two places at once"). However, when one of these properties is ...7 KB (1,105 words) - 21:06, 26 June 2017
- ...aphic]] attack which, like the [[birthday attack]], makes use of a [[space-time tradeoff]]. While the birthday attack attempts to find two values in the do ...ered a time-memory tradeoff that could break the scheme in only double the time to break the single-encryption scheme.<ref>{{cite journal ...3 KB (474 words) - 09:45, 20 October 2014
- ...walk, stationary distribution, convergence of Markov chain, hitting/cover time | ([http://tcs.nju.edu.cn/slides/random2015/MarkovChain.pdf slides]) ...算法 (Fall 2015)/Mixing Time and Coupling|Mixing Time and Coupling]]: mixing time, coupling lemma, coupling of Markov chain, rapid mixing by coupling | ( ...9 KB (893 words) - 12:43, 15 September 2017
- ...walk, stationary distribution, convergence of Markov chain, hitting/cover time ...(Spring 2014)/Mixing Time and Coupling|Mixing Time and Coupling]]: mixing time, coupling lemma, coupling of Markov chain, rapid mixing by coupling ...9 KB (846 words) - 07:34, 2 June 2014