A two-dimensional direction-length framework is a pair (G, p), where G = (V ; D, L) is a graph whose edges are labeled as `direction' or `length' edges, and a map p from...
We present a simple algorithm for computing straight skeletons of planar straight-line graphs. We exploit the relation between motorcycle graphs and straight skeletons, and introd...
Users of online communities are commonly classified into active members versus lurkers. In this work we experiment with a method designed to encourage lurkers to share their acqui...
Rosta Farzan, Joan Morris DiMicco, Beth Brownholtz
Abstract. We introduce a distributed high performance hybrid Information Service Architecture, which forms a metadata replica hosting system to manage both highlydynamic, small-sca...
A computationally efficient approach to local learning with kernel methods is presented. The Fast Local Kernel Support Vector Machine (FaLK-SVM) trains a set of local SVMs on redu...