일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 | 31 |
- Breaking_Record
- error1290
- leetcode
- 용어
- Tabular Data
- hackerrank
- Anaconda
- Github
- ChatGPT
- Server
- Palindrome_Number
- secure-file-priv
- camelcase4
- sparsearrays
- MySQL
- Linux
- invoke-expression
- error
- jmeter
- Mini-Max-Sum
- Artificial Intelligence
- CNN
- Time-conversion
- 코딩테스트
- 백준
- tensorflow
- LeNet-5
- Plus-Minus
- Python
- divisiblesumpairs
- Today
- Total
목록전체 글 (46)
Juni_DEV
Palindrome Number - LeetCode Can you solve this real interview question? Palindrome Number - Given an integer x, return true if x is a palindrome, and false otherwise. Example 1: Input: x = 121 Output: true Explanation: 121 reads as 121 from left to right and from right to left. Ex leetcode.com 주어진 문제 더보기 Given an integer x, return true if x is a palindrome, and false otherwise. Example 1: Input..
Breaking the Records | HackerRank Given an array of Maria's basketball scores all season, determine the number of times she breaks her best and worst records. www.hackerrank.com 주어진 문제 더보기 Maria plays college basketball and wants to go pro. Each season she maintains a record of her play. She tabulates the number of times she breaks her season record for most points and least points in a game. Po..
Two Sum - LeetCode Can you solve this real interview question? Two Sum - Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target. You may assume that each input would have exactly one solution, and you may not leetcode.com 주어진 문제 더보기 Given an array of integers nums and an integer target, return indices of the two numbers such that ..
Mini-Max Sum | HackerRank Find the maximum and minimum values obtained by summing four of five integers. www.hackerrank.com 주어진 문제 더보기 Given five positive integers, find the minimum and maximum values that can be calculated by summing exactly four of the five integers. Then print the respective minimum and maximum values as a single line of two space-separated long integers. Example arr = [1,3,5..
Time Conversion | HackerRank Convert time from an AM/PM format to a 24 hour format. www.hackerrank.com 주어진 문제 더보기 Given a time in 12-hour AM/PM format, convert it to military (24-hour) time. Note: - 12:00:00AM on a 12-hour clock is 00:00:00 on a 24-hour clock. - 12:00:00PM on a 12-hour clock is 12:00:00 on a 24-hour clock. Example s = '12:01:00PM" Return '12:01:00'. s = '12:01:00AM' Return '00:0..
Plus Minus | HackerRank Calculate the fraction of positive, negative and zero values in an array. www.hackerrank.com 주어진 문제 더보기 Given an array of integers, calculate the ratios of its elements that are positive, negative, and zero. Print the decimal value of each fraction on a new line with 6 places after the decimal. Note: This challenge introduces precision problems. The test cases are scaled ..
이전 글에서 pytorch로 구현해봤으니 이번에는 tensorflow를 이용해서 Lenet-5를 구현해보자 구현 완료한 Tensorflow LeNet-5 Code https://github.com/juni5184/Paper_review/blob/main/(tensorflow)lenet-5.ipynb GitHub - juni5184/Paper_review Contribute to juni5184/Paper_review development by creating an account on GitHub. github.com (1) 필요한 라이브러리 import import numpy as np from keras.utils.np_utils import to_categorical from keras.models ..
논문에 나와있는 Lenet-5 구조 Input Layer : 32x32 C1 (Convolution) : 28x28x6 S2 (Subsampling) : 14x14x6 C3 (Convolution) : 10x10x16 S4 (Subsampling) : 5x5x16 C5 (Fully connection) : Layer 120 F6 (Fully Connection) : Layer 84 Output (Gaussian connections) : 10 구조까지는 파악하겠는데 도무지 어떻게 시작해야 될지 모르겠다. 다른 분이 작성한 코드를 보고 Colab 이용해서 공부하는 걸로 일단 노선 변경 구현 완료한 Pytorch LeNet-5 Code https://github.com/juni5184/Paper_review..