Sciweavers

1201 search results - page 100 / 241
» Linear Probing and Graphs
Sort
View
ISAAC
2005
Springer
131views Algorithms» more  ISAAC 2005»
15 years 9 months ago
Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends
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...
Xiao Zhou, Takao Nishizeki
129
Voted
CCCG
2008
15 years 5 months ago
On the Complexity of Point Recolouring in Geometric Graphs
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...
Henk Meijer, Yurai Núñez Rodrí...
COR
2006
94views more  COR 2006»
15 years 4 months ago
A comparison of two different formulations for arc routing problems on mixed graphs
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 ...
Angel Corberán, Enrique Mota, José M...
EMNLP
2009
15 years 1 months ago
Graph Alignment for Semi-Supervised Semantic Role Labeling
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 ...
Hagen Fürstenau, Mirella Lapata
ALT
2008
Springer
16 years 1 months ago
Exploiting Cluster-Structure to Predict the Labeling of a Graph
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...
Mark Herbster