
Generating Approximate Solutions to the TTP using a Linear Distance Relaxation
In some domestic professional sports leagues, the home stadiums are loca...
01/23/2014 ∙ by Richard Hoshino, et al. ∙ 0 ∙ shareread it

Scheduling Bipartite Tournaments to Minimize Total Travel Distance
In many professional sports leagues, teams from opposing leagues/confere...
01/16/2014 ∙ by Richard Hoshino, et al. ∙ 0 ∙ shareread it

Think Globally, Embed Locally  Locally Linear Metaembedding of Words
Distributed word embeddings have shown superior performances in numerous...
09/19/2017 ∙ by Danushka Bollegala, et al. ∙ 0 ∙ shareread it

Using kway Cooccurrences for Learning Word Embeddings
Cooccurrences between two words provide useful insights into the semant...
09/05/2017 ∙ by Danushka Bollegala, et al. ∙ 0 ∙ shareread it

Joint Word Representation Learning using a Corpus and a Semantic Lexicon
Methods for learning word representations using large text corpora have ...
11/19/2015 ∙ by Danushka Bollegala, et al. ∙ 0 ∙ shareread it

Embedding Semantic Relations into Word Representations
Learning representations for semantic relations is important for various...
05/01/2015 ∙ by Danushka Bollegala, et al. ∙ 0 ∙ shareread it

Learning Word Representations from Relational Graphs
Attributes of words and relations between two words are central to numer...
12/07/2014 ∙ by Danushka Bollegala, et al. ∙ 0 ∙ shareread it

Adapting Local Sequential Algorithms to the Distributed Setting
It is a well known fact that sequential algorithms which exhibit a stron...
11/28/2017 ∙ by Kenichi Kawarabayashi, et al. ∙ 0 ∙ shareread it

A Deterministic Distributed 2Approximation for Weighted Vertex Cover in O( n/ ^2) Rounds
We present a deterministic distributed 2approximation algorithm for the...
04/04/2018 ∙ by Ran Ben Basat, et al. ∙ 0 ∙ shareread it

ClassiNet  Predicting Missing Features for ShortText Classification
The fundamental problem in shorttext classification is feature sparsene...
04/14/2018 ∙ by Danushka Bollegala, et al. ∙ 0 ∙ shareread it

Causal Bandits with Propagating Inference
Bandit is a framework for designing sequential experiments. In each expe...
06/06/2018 ∙ by Akihiro Yabe, et al. ∙ 0 ∙ shareread it

Representation Learning on Graphs with Jumping Knowledge Networks
Recent deep learning approaches for representation learning on graphs fo...
06/09/2018 ∙ by Keyulu Xu, et al. ∙ 0 ∙ shareread it

Parameterized Distributed Algorithms
In this work, we initiate a thorough study of parameterized graph optimi...
07/13/2018 ∙ by Ran Ben Basat, et al. ∙ 0 ∙ shareread it

Optimal Distributed Weighted Set Cover Approximation
We present a timeoptimal deterministic distributed algorithm for approx...
08/17/2018 ∙ by Ran Ben Basat, et al. ∙ 0 ∙ shareread it

Tight Upper Bounds on the Crossing Number in a MinorClosed Class
The crossing number of a graph is the minimum number of crossings in a d...
07/31/2018 ∙ by Vida Dujmovic, et al. ∙ 0 ∙ shareread it

ModelChecking on Ordered Structures
We study the modelchecking problem for first and monadic secondorder ...
12/18/2018 ∙ by Kord Eickmeyer, et al. ∙ 0 ∙ shareread it

Optimal Distributed Covering Algorithms
We present a timeoptimal deterministic distributed algorithm for approx...
02/25/2019 ∙ by Ran Ben Basat, et al. ∙ 0 ∙ shareread it

What Can Neural Networks Reason About?
Neural networks have successfully been applied to solving reasoning task...
05/30/2019 ∙ by Keyulu Xu, et al. ∙ 0 ∙ shareread it

Are Girls Neko or Shōjo? CrossLingual Alignment of NonIsomorphic Embeddings with Iterative Normalization
Crosslingual word embeddings (CLWE) underlie many multilingual natural ...
06/04/2019 ∙ by Mozhi Zhang, et al. ∙ 0 ∙ shareread it

Nonzerosum Stackelberg Budget Allocation Game for Computational Advertising
Computational advertising has been studied to design efficient marketing...
06/14/2019 ∙ by Daisuke Hatano, et al. ∙ 0 ∙ shareread it

Improved Distributed Approximation to Maximum Independent Set
We present improved results for approximating Maximum Independent Set ()...
06/27/2019 ∙ by Kenichi Kawarabayashi, et al. ∙ 0 ∙ shareread it

Anonymising Queries by Semantic Decomposition
Protecting the privacy of search engine users is an important requiremen...
09/12/2019 ∙ by Danushka Bollegala, et al. ∙ 0 ∙ shareread it
Kenichi Kawarabayashi
is this you? claim profile
Professor, National Institute of Informatics and JST ERATO Kawarabayashi Project