Randomized Algorithms for Solving Large Scale Nonlinear Least Squares Problems by Farbod Roosta-Khorasani

Source URL: www.stat.berkeley.edu

• Probabilistic complexity theory
• Numerical analysis
• Analysis of algorithms
• Algorithm
• Mathematical logic
• Theoretical computer science
• Monte Carlo method
• Pi
• Stochastic
• Randomized algorithm

Cognitive Science–291 Copyright © 2005 Cognitive Science Society, Inc. All rights reserved. Consequences of the Serial Nature of Linguistic Input for Sentenial Complexity Daniel J. Grodnera, Edward A. F.

Source URL: tedlab.mit.edu

• Syntax
• Grammar
• Generative linguistics
• Linguistic typology
• Semiotics
• Clause
• Locality
• Control
• Verb
• Transitive verb
• Relative clause
• Argument

CS261: A Second Course in Algorithms Lecture #11: Online Learning and the Multiplicative Weights Algorithm∗ Tim Roughgarden† February 9, 2016

Source URL: theory.stanford.edu

• Markov models
• Decision theory
• Search algorithms
• Probabilistic complexity theory
• Belief revision
• Reinforcement learning
• Minimax
• Randomized algorithm

解説：特集 高次機能の学習と創発 —脳・ロボット・人間研究における新たな展開— Simple Algorithmic Theory of Subjective Beauty, Novelty, Surprise, Interestingness, Attention,

Source URL: people.idsia.ch

• Artificial intelligence
• Educational psychology
• Machine learning
• Robotics
• Attention deficit hyperactivity disorder
• Low-complexity art
• Creativity
• Artificial neural network
• Aesthetics
• Cognitive robotics
• Data compression
• Factorial code

Canad. J. Math. Vol), 2005 pp. 328–337 On a Conjecture of Birch and Swinnerton-Dyer Wentang Kuo and M. Ram Murty Abstract. Let E/Q be an elliptic curve defined by the equation y 2 = x3 + ax + b. For a prime p,

Source URL: www.mast.queensu.ca

• Conjectures
• Analytic number theory
• Millennium Prize Problems
• Number theory
• Elliptic curve
• Group theory
• Birch and Swinnerton-Dyer conjecture
• Riemann hypothesis
• Abc conjecture
• Chain rule for Kolmogorov complexity

Introduction to Algorithms Massachusetts Institute of Technology Professors Erik Demaine, Piotr Indyk, and Manolis Kellis March 9, Spring 2011

Source URL: courses.csail.mit.edu

• Analysis of algorithms
• Binary trees
• Computational complexity theory
• Asymptotic analysis
• Sorting algorithms
• Best
• worst and average case
• Binary heap
• Heap
• Time complexity
• Hash table
• Binary search tree
• Master theorem

On the Complexity of Mining Itemsets from the Crowd Using Taxonomies Antoine Amarilli1,2 , Yael Amsterdamer1 , and Tova Milo1 1 Tel Aviv University, Tel Aviv, Israel

Source URL: www.cs.tau.ac.il

The Complexity of Several Realizability Problems for Abstract Topological Graphs Jan Kynˇcl Charles University, Prague Graph:

Source URL: kam.mff.cuni.cz

P, N P and mathematics – a computational complexity perspective Avi Wigderson December 21, 2006 “P versus N P – a gift to mathematics from computer science” Steve Smale

Source URL: www.math.ias.edu

ECG-derived AF complexity parameters predict AF rhythm control success but different populations might need different parameters 1,2 2

Source URL: www.malt-meeting.net

• Cardiac arrhythmia
• Cardiac electrophysiology
• Atrial fibrillation
• RTT
• Interventional radiology
• Surgical oncology
• Radiofrequency ablation
• Electrocardiography
• Cardioversion
• Cardiology
• Management of atrial fibrillation