Notice
Recent Posts
Recent Comments
Link
| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 1 | 2 | 3 | 4 | 5 | 6 | |
| 7 | 8 | 9 | 10 | 11 | 12 | 13 |
| 14 | 15 | 16 | 17 | 18 | 19 | 20 |
| 21 | 22 | 23 | 24 | 25 | 26 | 27 |
| 28 | 29 | 30 |
Tags
- REINFORCE
- loss functions
- rest-api
- remove outliers
- shadowing
- Knowledge Distillation
- resample
- objective functions for machine learning
- MRI
- noise contrast estimation
- domain adaptation
- Inorder Traversal
- normalization
- fastapi
- scowl
- model-free control
- clip intensity values
- Excel
- Policy Gradient
- non parametic softmax
- Actor-Critic
- thresholding
- freebooze
- checkitout
- 자료구조
- pulloff
- sample rows
- straightup
- 3d medical image
- sidleup
Archives
- Today
- Total
Let's Run Jinyeah
Outer product, Inner product 본문
Outer product
- uvT
- output: matrix
- time complexity: O(n2)
Inner product
- uTv
- output: scalar
- time complexity: O(n)
- a = [a0, a1, a2, ... , aN-1], b = [b0, b1, b2, ...., bN-1]
- a0*b0 + a1*b1 + aN-1*bN-1
- Assuming that multiplication and addition are constant-time operations, the time-complexity is O(n)
- Multiply O(n) + add O(n) = O(n)
'Programming > Algorithm' 카테고리의 다른 글
| [Python] list 원소의 모든 조합 구하기 (0) | 2021.11.17 |
|---|---|
| [Python] Data Structure - Tree (0) | 2021.10.19 |
| [Python] 이진탐색 (0) | 2021.10.19 |
| [Python] 정렬 - 선택, 삽입, 퀵 (0) | 2021.10.14 |
| [Python] 기본 탐색 - 완전탐색, DFS/BFS (0) | 2021.10.14 |
Comments