
Generating Approximate Solutions to the TTP using a Linear Distance Relaxation
In some domestic professional sports leagues, the home stadiums are loca...
read it

Scheduling Bipartite Tournaments to Minimize Total Travel Distance
In many professional sports leagues, teams from opposing leagues/confere...
read it

Think Globally, Embed Locally  Locally Linear Metaembedding of Words
Distributed word embeddings have shown superior performances in numerous...
read it

Using kway Cooccurrences for Learning Word Embeddings
Cooccurrences between two words provide useful insights into the semant...
read it

Joint Word Representation Learning using a Corpus and a Semantic Lexicon
Methods for learning word representations using large text corpora have ...
read it

Embedding Semantic Relations into Word Representations
Learning representations for semantic relations is important for various...
read it

Learning Word Representations from Relational Graphs
Attributes of words and relations between two words are central to numer...
read it

Adapting Local Sequential Algorithms to the Distributed Setting
It is a well known fact that sequential algorithms which exhibit a stron...
read it

A Deterministic Distributed 2Approximation for Weighted Vertex Cover in O( n/ ^2) Rounds
We present a deterministic distributed 2approximation algorithm for the...
read it

ClassiNet  Predicting Missing Features for ShortText Classification
The fundamental problem in shorttext classification is feature sparsene...
read it

Causal Bandits with Propagating Inference
Bandit is a framework for designing sequential experiments. In each expe...
read it

Representation Learning on Graphs with Jumping Knowledge Networks
Recent deep learning approaches for representation learning on graphs fo...
read it

Parameterized Distributed Algorithms
In this work, we initiate a thorough study of parameterized graph optimi...
read it

Optimal Distributed Weighted Set Cover Approximation
We present a timeoptimal deterministic distributed algorithm for approx...
read 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...
read it

ModelChecking on Ordered Structures
We study the modelchecking problem for first and monadic secondorder ...
read it

Optimal Distributed Covering Algorithms
We present a timeoptimal deterministic distributed algorithm for approx...
read it

What Can Neural Networks Reason About?
Neural networks have successfully been applied to solving reasoning task...
read it

Are Girls Neko or Shōjo? CrossLingual Alignment of NonIsomorphic Embeddings with Iterative Normalization
Crosslingual word embeddings (CLWE) underlie many multilingual natural ...
read it

Nonzerosum Stackelberg Budget Allocation Game for Computational Advertising
Computational advertising has been studied to design efficient marketing...
read it

Improved Distributed Approximation to Maximum Independent Set
We present improved results for approximating Maximum Independent Set ()...
read it

Anonymising Queries by Semantic Decomposition
Protecting the privacy of search engine users is an important requiremen...
read it
Kenichi Kawarabayashi
is this you? claim profile
Professor, National Institute of Informatics and JST ERATO Kawarabayashi Project