We present DeepWalk, a novel approach for learning latent representations of vertices in a network. These latent representations encode social relations in a continuous vector space, which is easily… (More)

Distributed word representations (word embeddings) have recently contributed to competitive performance in language modeling and several NLP tasks. In this work, we train word embeddings for more… (More)

Many people are trying to be smarter every day. How's about you? There are many ways to evoke this case you can find knowledge and lesson everywhere you want. However, it will involve you to get what… (More)

The n-th power (n 1) of a graph G = (V; E), written G n , is deened to be the graph having V as its vertex set with two vertices u; v adjacent in G n if and only if there exists a path of length at… (More)

We study the problem of finding lowest common ancestors (LCA) in trees anddirected acyclic graphs (DAGs). Specifically, we extend the LCA problem to DAGs and study the LCA variants that arise i… (More)

Which point sets realize a given distance multiset? Interesting cases include the “turnpike problem” where the points lie on a line, the “beltway problem” where the points lie on a loop, and… (More)

Almost all scientific visualization involving surfaces is currently done via triangles. The speed at which such triangulated surfaces can be displayed is crucial to interactive visualization and is… (More)

As a result of the redundancy of the genetic code, adjacent pairs of amino acids can be encoded by as many as 36 different pairs of synonymous codons. A species-specific "codon pair bias" provides… (More)

We propose a new computational approach for tracking and detecting statistically significant linguistic shifts in the meaning and usage of words. Such linguistic shifts are especially prevalent on… (More)