Sciweavers

970 search results - page 61 / 194
» On encodings of spanning trees
Sort
View
DEXAW
2008
IEEE
252views Database» more  DEXAW 2008»
14 years 3 months ago
XML Tree Structure Compression
In an XML document a considerable fraction consists of markup, that is, begin and end-element tags describing the document’s tree structure. XML compression tools such as XMill ...
Sebastian Maneth, Nikolay Mihaylov, Sherif Sakr
COMGEO
2010
ACM
13 years 9 months ago
Flexible isosurfaces: Simplifying and displaying scalar topology using the contour tree
our tree is an abstraction of a scalar field that encodes the nesting relationships of isosurfaces. We show how to use the contour tree to represent individual contours of a scala...
Hamish Carr, Jack Snoeyink, Michiel van de Panne
FOCS
2008
IEEE
14 years 3 months ago
Shallow-Low-Light Trees, and Tight Lower Bounds for Euclidean Spanners
We show that for every n-point metric space M and positive integer k, there exists a spanning tree T with unweighted diameter O(k) and weight w(T) = O(k · n1/k ) · w(MST(M)), an...
Yefim Dinitz, Michael Elkin, Shay Solomon
ACL
2012
11 years 11 months ago
Extracting Narrative Timelines as Temporal Dependency Structures
We propose a new approach to characterizing the timeline of a text: temporal dependency structures, where all the events of a narrative are linked via partial ordering relations l...
Oleksandr Kolomiyets, Steven Bethard, Marie-Franci...
ALGORITHMICA
2007
80views more  ALGORITHMICA 2007»
13 years 9 months ago
Tree Spanners for Bipartite Graphs and Probe Interval Graphs
A tree t-spanner T in a graph G is a spanning tree of G such that the distance between every pair of vertices in T is at most t times their distance in G. The tree t-spanner proble...
Andreas Brandstädt, Feodor F. Dragan, Ho&agra...