In an orthogonal drawing of a planar graph G, each vertex is drawn as a point, each edge is drawn as a sequence of alternate horizontal and vertical line segments, and any two edge...
Given a collection of points representing geographic data we consider the task of delineating boundaries based on the features of the points. Assuming that the features are binary...
Arc Routing Problems on mixed graphs have been modelled in the literature either using just one variable per edge or associating to each edge two variables, each one representing ...
Unknown lexical items present a major obstacle to the development of broadcoverage semantic role labeling systems. We address this problem with a semisupervised learning approach ...
Abstract. The nearest neighbor and the perceptron algorithms are intuitively motivated by the aims to exploit the “cluster” and “linear separation” structure of the data to...