Resampling: The New Statistics
by Julian L. Simon Second Edition published October 1997 This text grew out of chapters in the 1969 edition of Basic Research Methods in Social Science by the same author, and contains the first published example of what was later called the bootstrap. Simon is best known for his research in demography, population and the economics of natural resources, and gained fame when the noted biologist P
Convex Optimization – Boyd and Vandenberghe
A MOOC on convex optimization, CVX101, was run from 1/21/14 to 3/14/14. If you register for it, you can access all the course materials. More material can be found at the web sites for EE364A (Stanford) or EE236B (UCLA), and our own web pages. Source code for almost all examples and figures in part 2 of the book is available in CVX (in the examples directory), in CVXOPT (in the book examples direc
Combinator Birds
((S(K((S((SK)K))(K((S(K(S((SK)K))))K)))))((S(K((S(K((S(KS))K)))((S(KS))K))))((S(K(S((SK)K))))K)))
数列辞典
The page you're looking for has moved, been replaced, or is currently unavailable to view. If you previously bookmarked a page and have now reached this message, check to make sure the link was not shortened, or go to our home page to find the page from there. We've been upgrading this site. If you selected a link on our site and reached this message, use the Back button to return to the previous
Matrix Reference Manual: Matrix Calculus
Matrix Calculus Go to: Introduction, Notation, Index Contents of Calculus Section Notation Differentials of Linear, Quadratic and Cubic Products Differentials of Inverses, Trace and Determinant Hessian matrices Notation j is the square root of -1 XR and XI are the real and imaginary parts of X = XR + jXI (XY)R = XRYR - XIYI (XY)I = XRYI + XIYR XC = XR - jXI is the complex conjugate of X XH=(XR)T=(
CS Theory @ Princeton : Draft
Computational Complexity: A Modern Approach Textbook by Sanjeev Arora and Boaz Barak, Cambridge University Press. complexitybook@gmail.com home | draft and extras | teaching plans This page contains early drafts of the book, as well as links to additional relevant material available online. See this page for links to courses using this book. Table of contents, preface and introduction of final dr
MIT's Introduction to Algorithms, Lectures 1 and 2: Analysis of Algorithms
I just finished watching the last lecture of MIT's "Introduction to Algorithms" course. Having a great passion for all aspects of computing, I decided to share everything I learned with you. This is the first post in an article series about this course. As I wrote earlier, I am very serious about watching video lectures. If they are math-intensive, I usually take notes as if I were in the classroo
1
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
http://www.cise.ufl.edu/research/sparse/SuiteSparse/
Why It’s Called Pi – Neatorama
Index of /~jason/Classes/numwisk
http://www.ring.gr.jp/pub/text/CTAN/macros/latex/required/amslatex/classes/instr-l.pdf