1154 search results - page 74 / 231 » On the editing distance of graphs |
161
click to vote
DOCENG
2003
ACM
15 years 11 months ago
2003
ACM
By exploiting the theories of automata and graphs, we propose algorithms and a process for editing valid XML documents [4][5]. The editing process avoids syntactic violations alto...
148
click to vote
STOC
2002
ACM
16 years 6 months ago
2002
ACM
Two infinite walks on the same finite graph are called compatible if it is possible to introduce delays into them in such a way that they never collide. Years ago, Peter Winkler a...
154
click to vote
ASPDAC
2005
ACM
15 years 8 months ago
2005
ACM
Abstract— ACG (Adjacent Constraint Graph) is a general floorplan representation. The refinement of constraint graphs gives not only an efficient representation but also a repre...
214
click to vote
TSMC
2010
15 years 27 days ago
2010
We study the problem of projecting high-dimensional tensor data on an unspecified Riemannian manifold onto some lower dimensional subspace1 without much distorting the pairwise geo...
194
click to vote
WWW
2005
ACM
16 years 6 months ago
2005
ACM
We describe Thresher, a system that lets non-technical users teach their browsers how to extract semantic web content from HTML documents on the World Wide Web. Users specify exam...