3267 search results - page 283 / 654 » Generalized quasirandom graphs |
184
click to vote
COMPGEOM
2003
ACM
16 years 2 days ago
2003
ACM
Given a polygonal curve and a geometric graph, we describe an efficient algorithm to find a path in the graph which is most similar to the curve, using the well-known Fr´echet d...
214
click to vote
AAIM
2007
Springer
15 years 11 months ago
2007
Springer
Given an acyclic directed graph and two distinct nodes s and t, we consider the problem of finding k disjoint paths from s to t satisfying some objective. We consider four objectiv...
181
Voted
COCOA
2008
Springer
15 years 8 months ago
2008
Springer
The goal of the Cluster Editing problem is to make the fewest changes to the edge set of an input graph such that the resulting graph is a disjoint union of cliques. This problem i...
168
Voted
EMNLP
2007
15 years 8 months ago
2007
Shallow semantic parsing, the automatic identification and labeling of sentential constituents, has recently received much attention. Our work examines whether semantic role info...
147
click to vote
NIPS
2008
15 years 8 months ago
2008
We present a characterization of a useful class of skills based on a graphical representation of an agent's interaction with its environment. Our characterization uses betwee...