A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is a k-le...
We present a graph-based semi-supervised learning for the question-answering (QA) task for ranking candidate sentences. Using textual entailment analysis, we obtain entailment sco...
Software projects often fail because stakeholder communication and involvement are inadequate. This paper proposes a novel method to understand project social networks and their c...
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
Historical prices are important information that can help consumers decide whether the time is right to buy a product. They provide both a context to the users, and facilitate the...