SlideShare a Scribd company logo
1 of 6
Download to read offline
Aqua Beamer テンプレート
相馬 輔 (東京大学)
ほげほげ研究室
2015/3/26
1 / 6
1 フレーム
2 アルゴリズム
2 / 6
1 フレーム
2 アルゴリズム
3 / 6
フレーム
block sample
ブロック環境のサンプル
alerted text
example block sample
Example ブロック環境のサンプル
定理
mythm 環境のサンプル
4 / 6
1 フレーム
2 アルゴリズム
5 / 6
アルゴリズムサンプル
Matrix Multiplication
1: C = O
2: for i = 1, . . . , m :
3: for j = 1, . . . , n :
4: for k = 1, . . . , r :
5: C[i, j] = C[i, j] + A[i, k] · B[k, j]
6: return C
6 / 6

More Related Content

More from Tasuku Soma

Regret Minimization in Multi-objective Submodular Function Maximization
Regret Minimization in Multi-objective Submodular Function MaximizationRegret Minimization in Multi-objective Submodular Function Maximization
Regret Minimization in Multi-objective Submodular Function MaximizationTasuku Soma
 
Nonconvex Compressed Sensing with the Sum-of-Squares Method
Nonconvex Compressed Sensing with the Sum-of-Squares MethodNonconvex Compressed Sensing with the Sum-of-Squares Method
Nonconvex Compressed Sensing with the Sum-of-Squares MethodTasuku Soma
 
Maximizing Submodular Function over the Integer Lattice
Maximizing Submodular Function over the Integer LatticeMaximizing Submodular Function over the Integer Lattice
Maximizing Submodular Function over the Integer LatticeTasuku Soma
 
整数格子点上の劣モジュラ被覆に対する高速アルゴリズム
整数格子点上の劣モジュラ被覆に対する高速アルゴリズム整数格子点上の劣モジュラ被覆に対する高速アルゴリズム
整数格子点上の劣モジュラ被覆に対する高速アルゴリズムTasuku Soma
 
The low-rank basis problem for a matrix subspace
The low-rank basis problem for a matrix subspaceThe low-rank basis problem for a matrix subspace
The low-rank basis problem for a matrix subspaceTasuku Soma
 
Optimal Budget Allocation: Theoretical Guarantee and Efficient Algorithm
Optimal Budget Allocation: Theoretical Guarantee and Efficient AlgorithmOptimal Budget Allocation: Theoretical Guarantee and Efficient Algorithm
Optimal Budget Allocation: Theoretical Guarantee and Efficient AlgorithmTasuku Soma
 
計算情報学研究室 (数理情報学第7研究室)
計算情報学研究室  (数理情報学第7研究室) 計算情報学研究室  (数理情報学第7研究室)
計算情報学研究室 (数理情報学第7研究室) Tasuku Soma
 
Multicasting in Linear Deterministic Relay Network by Matrix Completion
Multicasting in Linear Deterministic Relay Network by Matrix CompletionMulticasting in Linear Deterministic Relay Network by Matrix Completion
Multicasting in Linear Deterministic Relay Network by Matrix CompletionTasuku Soma
 
Optimal Budget Allocation: Efficient Algorithm and Theoretical Guarantee (ERA...
Optimal Budget Allocation: Efficient Algorithm and Theoretical Guarantee (ERA...Optimal Budget Allocation: Efficient Algorithm and Theoretical Guarantee (ERA...
Optimal Budget Allocation: Efficient Algorithm and Theoretical Guarantee (ERA...Tasuku Soma
 
行列補完を用いた無線マルチキャスト符号構成アルゴリズム
行列補完を用いた無線マルチキャスト符号構成アルゴリズム行列補完を用いた無線マルチキャスト符号構成アルゴリズム
行列補完を用いた無線マルチキャスト符号構成アルゴリズムTasuku Soma
 
Fast Deterministic Algorithms for Matrix Completion Problems
Fast Deterministic Algorithms for Matrix Completion ProblemsFast Deterministic Algorithms for Matrix Completion Problems
Fast Deterministic Algorithms for Matrix Completion ProblemsTasuku Soma
 

More from Tasuku Soma (11)

Regret Minimization in Multi-objective Submodular Function Maximization
Regret Minimization in Multi-objective Submodular Function MaximizationRegret Minimization in Multi-objective Submodular Function Maximization
Regret Minimization in Multi-objective Submodular Function Maximization
 
Nonconvex Compressed Sensing with the Sum-of-Squares Method
Nonconvex Compressed Sensing with the Sum-of-Squares MethodNonconvex Compressed Sensing with the Sum-of-Squares Method
Nonconvex Compressed Sensing with the Sum-of-Squares Method
 
Maximizing Submodular Function over the Integer Lattice
Maximizing Submodular Function over the Integer LatticeMaximizing Submodular Function over the Integer Lattice
Maximizing Submodular Function over the Integer Lattice
 
整数格子点上の劣モジュラ被覆に対する高速アルゴリズム
整数格子点上の劣モジュラ被覆に対する高速アルゴリズム整数格子点上の劣モジュラ被覆に対する高速アルゴリズム
整数格子点上の劣モジュラ被覆に対する高速アルゴリズム
 
The low-rank basis problem for a matrix subspace
The low-rank basis problem for a matrix subspaceThe low-rank basis problem for a matrix subspace
The low-rank basis problem for a matrix subspace
 
Optimal Budget Allocation: Theoretical Guarantee and Efficient Algorithm
Optimal Budget Allocation: Theoretical Guarantee and Efficient AlgorithmOptimal Budget Allocation: Theoretical Guarantee and Efficient Algorithm
Optimal Budget Allocation: Theoretical Guarantee and Efficient Algorithm
 
計算情報学研究室 (数理情報学第7研究室)
計算情報学研究室  (数理情報学第7研究室) 計算情報学研究室  (数理情報学第7研究室)
計算情報学研究室 (数理情報学第7研究室)
 
Multicasting in Linear Deterministic Relay Network by Matrix Completion
Multicasting in Linear Deterministic Relay Network by Matrix CompletionMulticasting in Linear Deterministic Relay Network by Matrix Completion
Multicasting in Linear Deterministic Relay Network by Matrix Completion
 
Optimal Budget Allocation: Efficient Algorithm and Theoretical Guarantee (ERA...
Optimal Budget Allocation: Efficient Algorithm and Theoretical Guarantee (ERA...Optimal Budget Allocation: Efficient Algorithm and Theoretical Guarantee (ERA...
Optimal Budget Allocation: Efficient Algorithm and Theoretical Guarantee (ERA...
 
行列補完を用いた無線マルチキャスト符号構成アルゴリズム
行列補完を用いた無線マルチキャスト符号構成アルゴリズム行列補完を用いた無線マルチキャスト符号構成アルゴリズム
行列補完を用いた無線マルチキャスト符号構成アルゴリズム
 
Fast Deterministic Algorithms for Matrix Completion Problems
Fast Deterministic Algorithms for Matrix Completion ProblemsFast Deterministic Algorithms for Matrix Completion Problems
Fast Deterministic Algorithms for Matrix Completion Problems
 

Beamertemplete