Query log analysis has received substantial attention in recent years, in which the click graph is an important technique for describing the relationship between queries and URLs....
Abstract. Consider a weighted and undirected graph, possibly with self-loops, and its corresponding Laplacian matrix, possibly augmented with additional diagonal elements correspon...
Underspecification-based algorithms for processing partially disambiguated discourse structure must cope with extremely high numbers of readings. Based on previous work on dominan...
We pose a modified version of the two-sided orthogonal Procrustes problem subject to a grouping constraint, and offer an efficient solution method. This problem has applications...
We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...