Search results

Jump to navigation Jump to search

  • Voltage
    == Measuring tools == Some of the tools for measuring the voltage are the [[voltmeter]] and the [[oscilloscope]]. ...
    4 KB (668 words) - 21:23, 2 March 2016
  • Jerk
    ...exposure to jerk is often a good predictor of the rate of deterioration of tools while in normal use; it corresponds better to the appearance of metal fatig ...
    1 KB (221 words) - 03:01, 24 March 2016
  • Mathematics
    == Mathematical tools == There are many tools that are used to do mathematics or to find answers to mathematics problems. ...
    9 KB (1,088 words) - 18:04, 22 August 2017
  • Simple harmonic motion
    [[Category:Mathematical tools]] ...
    2 KB (431 words) - 21:21, 22 August 2017
  • 随机算法 (Spring 2013)/Problem Set 2
    ...d question was wrong. The second question is now optional and use whatever tools you can come up with.</font>) ...
    3 KB (537 words) - 01:06, 16 April 2013
  • 随机算法 (Fall 2011)/Chebyshev's Inequality
    ...n the '''mutual''' independence. This makes the variance-based probability tools work even for weakly random cases. We will see what it exactly means in the ...
    5 KB (821 words) - 03:48, 19 July 2011
  • Wedge (mechanics)
    [[Category:Tools]] ...
    4 KB (601 words) - 17:19, 21 March 2017
  • List of series
    ...nite]] and [[infinite]] [[sum]]s. It can be used in conjunction with other tools for [[evaluating sums]]. ...
    7 KB (1,090 words) - 18:10, 19 October 2014
  • Cosmic distance ladder
    | title=Eclipsing binaries: tools for calibrating the extragalactic distance scale | journal=Binary stars as critical tools and tests in contemporary astrophysics: International Astronomical Union. S ...
    10 KB (1,469 words) - 22:59, 15 September 2015
  • 随机算法 (Fall 2011)/Universal hashing
    == Tools for limited independence == ...om variables, such as the Chernoff bounds. On the positive side, there are tools that require less independence. ...
    37 KB (6,743 words) - 09:07, 13 November 2011
  • 随机算法 (Fall 2011)/Randomized Min-Cut
    Do we have to rely on the "advanced" tools like flows? The answer is "no", with a little help of randomness. ...
    7 KB (1,302 words) - 17:40, 4 September 2011
  • \Delta Seminar on Logic, Philosophy, and Computer Science
    ...scheme for counting problems. Canonical paths is one of the most important tools for proving the efficiency of the MCMC based algorithms and has been succes ...
    5 KB (714 words) - 04:34, 17 January 2018
  • 随机算法 (Fall 2011)/Limited independence
    = Tools for limited independence = ...oment is the expectation of a k-degree polynomial of random variables, the tools based on the <math>k</math>th moment can be safely used for the k-wise inde ...
    18 KB (3,232 words) - 07:32, 21 November 2011
  • Randomized Algorithms (Spring 2010)/Hashing, limited independence
    === Tools for limited independence === ...om variables, such as the Chernoff bounds. On the positive side, there are tools that require less independence. ...
    42 KB (7,662 words) - 08:41, 7 June 2010
  • 随机算法 (Spring 2013)/Universal Hashing
    == Tools for limited independence == ...oment is the expectation of a k-degree polynomial of random variables, the tools based on the <math>k</math>th moment can be safely used for the k-wise inde ...
    39 KB (7,106 words) - 09:54, 24 May 2013
  • Randomized Algorithms (Spring 2010)/Tail inequalities
    ...h>X\ge t</math>. Besides this ''ad hoc'' way, we want to have some general tools which estimate tail probabilities based on certain information regarding t ...n the '''mutual''' independence. This makes the variance-based probability tools work even for weakly random cases. We will see what it exactly means in the ...
    30 KB (5,292 words) - 07:49, 3 August 2011
  • Differential scanning calorimeter
    ...tration calorimetry and differential scanning calorimetry as complementary tools to investigate the energetics of biomolecular recognition.'' J. Mol. Recogn ...
    10 KB (1,538 words) - 19:06, 20 August 2017
  • 高级算法 (Fall 2021)/Limited independence
    Hashing is one of the oldest tools in Computer Science. Knuth's memorandum in 1963 on analysis of hash tables ...
    15 KB (2,781 words) - 06:17, 29 September 2021
  • 高级算法 (Fall 2022)/Limited independence
    Hashing is one of the oldest tools in Computer Science. Knuth's memorandum in 1963 on analysis of hash tables ...
    15 KB (2,781 words) - 15:47, 3 October 2022
  • 高级算法 (Fall 2023)/Limited independence
    Hashing is one of the oldest tools in Computer Science. Knuth's memorandum in 1963 on analysis of hash tables ...
    15 KB (2,781 words) - 16:38, 26 September 2023
  • 随机算法 (Fall 2011)/Universal hash families
    Hashing is one of the oldest tools in Computer Science. Knuth's memorandum in 1963 on analysis of hash tables ...
    16 KB (2,812 words) - 06:21, 21 November 2011
  • Algebra
    ...get a certain number out. When using functions, [[graph]]s can be powerful tools in helping us to study the solutions to equations. ...
    13 KB (2,204 words) - 07:13, 30 July 2017
  • Randomized Algorithms (Spring 2010)/Introduction
    Do we have to rely on the "advanced" tools like flows? The answer is "no", with a little help of randomness. ...
    16 KB (2,893 words) - 08:43, 7 June 2010
  • 组合数学 (Fall 2017)/Extremal graph theory
    ...has been proved for many times by different mathematicians, with different tools. We show just a few. ...
    18 KB (3,527 words) - 06:10, 22 November 2017
  • 组合数学 (Fall 2019)/Extremal graph theory
    ...has been proved for many times by different mathematicians, with different tools. We show just a few. ...
    18 KB (3,527 words) - 05:55, 12 November 2019
  • 组合数学 (Fall 2023)/Extremal graph theory
    ...has been proved for many times by different mathematicians, with different tools. We show just a few. ...
    18 KB (3,527 words) - 08:55, 4 May 2023
  • 组合数学 (Spring 2016)/Extremal graph theory
    ...has been proved for many times by different mathematicians, with different tools. We show just a few. ...
    18 KB (3,527 words) - 05:10, 9 November 2016
  • 组合数学 (Spring 2015)/Extremal graph theory
    ...has been proved for many times by different mathematicians, with different tools. We show just a few. ...
    19 KB (3,541 words) - 07:47, 25 December 2015
  • Eigenvalues and eigenvectors
    | chapter = Chapter II. The mathematical tools of quantum mechanics ...
    13 KB (1,723 words) - 07:13, 11 November 2016
  • Combinatorics (Fall 2010)/Extremal graphs
    ...has been proved for many times by different mathematicians, with different tools. We show just a few. ...
    21 KB (3,921 words) - 08:23, 13 November 2010
  • 组合数学 (Fall 2011)/Extremal graph theory
    ...has been proved for many times by different mathematicians, with different tools. We show just a few. ...
    21 KB (3,922 words) - 01:04, 3 November 2011
  • 组合数学 (Spring 2014)/Extremal graph theory
    ...has been proved for many times by different mathematicians, with different tools. We show just a few. ...
    21 KB (3,922 words) - 10:31, 16 April 2014
  • 组合数学 (Spring 2013)/Extremal graph theory
    ...has been proved for many times by different mathematicians, with different tools. We show just a few. ...
    21 KB (3,922 words) - 08:56, 20 May 2013
  • 随机算法 (Spring 2014)/Moment and Deviation
    ...n the '''mutual''' independence. This makes the variance-based probability tools work even for weakly random cases. We will see what it exactly means in the ...
    22 KB (3,809 words) - 05:34, 19 March 2014
  • Theory@Nanjing 2018
    ...ic computing, our result is the first rigorous incorporation of randomized tools in this setting, as well as the first nearly-linear time algorithm for prod ...
    14 KB (1,850 words) - 01:51, 7 May 2018
  • 组合数学 (Fall 2011)/Matching theory
    Although seemed specialized, the Hall's theorem is among the most useful tools in combinatorics, and is used to prove many seemingly unrelated results. On ...
    23 KB (4,382 words) - 02:41, 17 August 2011
  • Combinatorics (Fall 2010)/Finite set systems
    Although seemed specialized, the Hall's theorem is among the most useful tools in combinatorics, and is used to prove many seemingly unrelated results. On ...
    23 KB (4,382 words) - 05:07, 5 November 2010
  • Water turbine
    [[Category:Tools]] ...
    15 KB (2,242 words) - 18:49, 30 May 2017
  • 随机算法 (Spring 2013)/Moment and Deviation
    ...n the '''mutual''' independence. This makes the variance-based probability tools work even for weakly random cases. We will see what it exactly means in the ...
    24 KB (4,172 words) - 15:38, 19 March 2013
  • 随机算法 (Fall 2011)/Rapid mixing random walks
    Here we prefer to use our version, because it is convenient to use the tools for norms to analyze it. ...
    27 KB (4,860 words) - 03:17, 22 March 2011
  • 随机算法 (Fall 2015)/Moment and Deviation
    ...n the '''mutual''' independence. This makes the variance-based probability tools work even for weakly random cases. We will see what it exactly means in the ...
    29 KB (5,238 words) - 05:34, 13 November 2015
  • 随机算法 (Spring 2014)/Introduction and Probability Space
    The course is organized by the advancedness of the probabilistic tools. We do this for two reasons: First, for randomized algorithms, analysis is ...
    22 KB (3,591 words) - 03:54, 17 February 2014
  • 随机算法 (Spring 2013)/Introduction and Probability Space
    The course is organized by the advancedness of the probabilistic tools. We do this for two reasons: First, for randomized algorithms, analysis is ...
    22 KB (3,591 words) - 10:45, 4 March 2013
  • 随机算法 (Spring 2014)/Universal Hashing
    Hashing is one of the oldest tools in Computer Science. Knuth's memorandum in 1963 on analysis of hash tables ...
    31 KB (5,704 words) - 08:39, 5 May 2014
  • 随机算法 (Fall 2015)/Universal Hashing
    Hashing is one of the oldest tools in Computer Science. Knuth's memorandum in 1963 on analysis of hash tables ...
    31 KB (5,704 words) - 05:36, 13 November 2015
  • Randomized Algorithms (Spring 2010)/Expander graphs and rapid mixing random walks
    Here we prefer to use our version, because it is convenient to use the tools for norms to analyze it. ...
    35 KB (6,195 words) - 08:39, 7 June 2010
  • 高级算法 (Fall 2022)/Balls into bins
    Hashing is one of the oldest tools in Computer Science. Knuth's memorandum in 1963 on analysis of hash tables ...
    38 KB (6,912 words) - 15:45, 3 October 2022
  • 高级算法 (Fall 2023)/Hashing and Sketching
    Hashing is one of the oldest tools in Computer Science. Knuth's memorandum in 1963 on analysis of hash tables ...
    48 KB (8,716 words) - 08:15, 15 October 2023
  • Uncertainty principle
    ...four-cylinder low horsepower motors for gasoline mowers and similar garden tools that it calls "Quantum." ...
    42 KB (7,065 words) - 02:42, 24 August 2017
Retrieved from "https://tcs.nju.edu.cn/wiki/index.php?title=Special:Search"