7 citations · 14 across the 12 of their papers we have counts for
Showing 2015Show all
3 papers · 1 filter
cs.DS2015
Towards single face shortest vertex-disjoint paths in undirected planar graphs
Glencora Borradaile, Amir Nayyeri, Farzad Zafarani
Given pairs of terminals in a graph , the min-sum vertex-disjoint paths problem is to find a collection $\{Q_{1}, Q_{2}, \ld…
cs.DB2015★ 2 cited
Cost-Effective Conceptual Design Using Taxonomies
Ali Vakilian, Yodsawalai Chodpathumwan, Arash Termehchy +1
It is known that annotating named entities in unstructured and semi-structured data sets by their concepts improves the effectiveness of answering queries over these data sets. As…
cs.CG2015
Approximating Nearest Neighbor Distances
Michael B. Cohen, Brittany Terese Fasy, Gary L. Miller +3
Several researchers proposed using non-Euclidean metrics on point sets in Euclidean space for clustering noisy data. Almost always, a distance function is desired that recognizes t…