- 2015年8月20日 開場:17時30分、開始18時、終了21:05(終了後懇親会)
- twitterハッシュタグ : #icmlyomi
- 配信URL(ニコ生):http://live.nicovideo.jp/watch/lv232277370
- 本資料のURL:https://gist.github.com/delta2323/553296939b273f8a3c02#file-schedule-md
- ニコ生による配信を行います。参加者が映り込む可能性がありますので、あらかじめご了承ください。
71 70 3 | |
1 27 42 | |
1 2 | |
2 3 | |
3 4 | |
4 5 | |
5 6 | |
6 7 | |
7 8 | |
8 9 |
#line 103 "EllysRivers.cpp" | |
#include <string> | |
#include <vector> | |
#include <iostream> | |
#include <sstream> | |
#include <set> | |
#include <map> | |
#include <cstring> | |
#include <cstdlib> | |
#include <algorithm> |
#line 73 "ElectionFraudDiv1.cpp" | |
#include <string> | |
#include <vector> | |
#include <iostream> | |
#include <sstream> | |
#include <set> | |
#include <map> | |
#include <cstring> | |
#include <cstdlib> | |
#include <algorithm> |
// (BITのコードは省略) | |
#define all(c) (c).begin(), (c).end() | |
#define iter(c) __typeof((c).begin) | |
#define cpresent(c, e) (find(all(c), (e)) != (c).end()) | |
#define rep(i, n) for(int i = 0; i < (int)(n); ++i) | |
#define tr(c, i) for(iter(c) i = (c).begin(); i != (c).end(); ++i) | |
#define pb(e) push_back(e) | |
#define mp(a, b) make_pair(a, b) |
// Problem Statement : http://code.google.com/codejam/contest/1835486/dashboard#s=p3 | |
// (include, using省略) | |
#define all(c) (c).begin(), (c).end() | |
#define iter(c) __typeof((c).begin()) | |
#define cpresent(c, e) (find(all(c), (e)) != (c).end()) | |
#define rep(i, n) for (int i = 0; i < (int)(n); i++) | |
#define tr(c, i) for (iter(c) i = (c).begin(); i != (c).end(); ++i) | |
#define pb(e) push_back(e) |
#!/usr/bin/env python | |
import unittest | |
from classifier.client import classifier | |
from classifier.types import * | |
# Please fill the blank according to your own setting. | |
BUILDDIR="" | |
def fork_process(port): |
/* | |
Solution for "A Tour of Go" Exercise #73 (This code does NOT work properly) | |
http://tour.golang.org/#73 | |
*/ | |
package main | |
import ( | |
"fmt" | |
) |
-- NN.Network | |
module NN.Network where | |
type Blob = [Float] | |
data Network d1 d2 = Nw (d1 -> d2) | |
class INetwork n where | |
forward :: n d1 d2 -> d1 -> d2 | |
(.) :: n d2 d3 -> n d1 d2 -> n d1 d3 |
# caffemodelの入手 | |
cd models/bvlc_reference_caffenet/ | |
wget http://dl.caffe.berkeleyvision.org/bvlc_reference_caffenet.caffemodel | |
# このURLはreadme.mdcaffemodel_urlを参照している | |
# ダウンロードに結構時間がかかる(30分くらい?) | |
# imagenet_mean.binaryprotoとsynset_words.txtの入手 | |
cd ../../ | |
./data/ilsvrc12/get_ilsvrc_aux.sh |