505 search results - page 21 / 101 » On A Graph Formalism for Ordered Edges |
178
click to vote
ACL
1993
15 years 8 months ago
1993
There is a need to develop a suitable computational grammar formalism for free word order languages for two reasons: First, a suitably designed formalism is likely to be more effi...
214
click to vote
IWPEC
2004
Springer
16 years 7 hour ago
2004
Springer
Let G = V; E be a graph. The linear-width of G is de ned as the smallest integer k such that E can be arranged in a linear ordering e1; : : : ; er such that for every i = 1; :...
198
click to vote
SOFSEM
2007
Springer
16 years 23 days ago
2007
Springer
In this paper we deal with making drawings of clustered hierarchical graphs nicer. Given a planar graph G = (V, E) with an assignment of the vertices to horizontal layers, a plane ...
165
click to vote
KDD
2004
ACM
16 years 7 months ago
2004
ACM
We define a connection subgraph as a small subgraph of a large graph that best captures the relationship between two nodes. The primary motivation for this work is to provide a pa...
160
click to vote
IJCV
2002
15 years 6 months ago
2002
This paper describes a new algorithm for disparity estimation using trinocular stereo. The three cameras are placed in a right angled configuration. A graph is then constructed wh...