chiwakii

#include <algorithm>
#include <iostream>
#include <vector>

int main() {
  std::vector<int> v = { 3, 1, 4 };

  std::cout << std::boolalpha;

  // 全ての要素が 5 より小さいか

chiwakii

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;
template <typename iterator>
void print(iterator first, iterator last)
{
    for(; first!=last; ++first){
        cout << *first << " ";

chiwakii

#include <algorithm>
#include <iostream>
#include <vector>
#include <list>

int main() {
  std::vector<int> v = { 1,2,1,2,3 };
  std::list<int> ls = { 1,2 };

  // 1,2 と連続している最初のシーケンスを探す

chiwakii

#include <algorithm>
#include <iostream>
#include <vector>
#include <list>

using namespace std;

template <class InputIterator>
void print(InputIterator first, InputIterator last) {
  for ( ; first != last; ++first)

chiwakii

#include <iostream>
#include <sstream>
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;

int main(void){

std::vector<int> v = {3, 7, 3, 11, 3, 3, 2};

chiwakii

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(void){
    // Here your code !
    vector <int> a{4,2,1,6,5,2};
    vector <int> b{1,2};
    sort(a.begin(), a.end());
    //アルゴリズムに使用にはコンテナ内の要素がソート済みである必要がある

chiwakii

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(void){
    // Here your code !
    vector <int> a{4,2,1,6,5,2};
    vector <int> b{1,2};
    sort(a.begin(), a.end());
    //アルゴリズムに使用にはコンテナ内の要素がソート済みである必要がある

chiwakii

Key-Value Memory Networks for Directly Reading Documents

Introduction

• Knowledge Bases (KBs) are effective tools for Question Answering (QA) but are often too restrictive (due to fixed schema) and too sparse (due to limitations of Information Extraction (IE) systems).
• The paper proposes Key-Value Memory Networks, a neural network architecture based on Memory Networks that can leverage both KBs and raw data for QA.
• The paper also introduces MOVIEQA, a new QA dataset that can be answered by a perfect KB, by Wikipedia pages and by an imperfect KB obtained using IE techniques thereby allowing a comparison between systems using any of the three sources.
• Link to the paper.

Related Work

chiwakii

#include <iostream>
#include <sstream>

#include <Windows.h>
#include <Kinect.h>
#include <opencv2/opencv.hpp>

#include <atlbase.h>

// Error Check 

chiwakii

// -------------------------------------------------------------------------
// Filename:	astar.h
// Version:	1.24 
// Date:	2002/03/08
// Purpose:	Provide template for a* algorythm
// (c) T.Frogley 1999-2002
// -------------------------------------------------------------------------

#ifndef ASTAR_H
#define ASTAR_H