Sciweavers

970 search results - page 58 / 194
» On encodings of spanning trees
Sort
View
COMBINATORICA
2008
112views more  COMBINATORICA 2008»
13 years 9 months ago
On the rigidity of molecular graphs
The rigidity of squares of graphs in three-space has important applications to the study of flexibility in molecules. The Molecular Conjecture, posed in 1984 by T-S. Tay and W. Wh...
Bill Jackson, Tibor Jordán
GAMESEC
2010
139views Game Theory» more  GAMESEC 2010»
13 years 6 months ago
Design of Network Topology in an Adversarial Environment
We study the strategic interaction between a network manager whose goal is to choose (as communication infrastructure) a spanning tree of a network given as an undirected graph, an...
Assane Gueye, Jean C. Walrand, Venkat Anantharam
ICALP
2009
Springer
14 years 9 months ago
On Cartesian Trees and Range Minimum Queries
We present new results on Cartesian trees with applications in range minimum queries and bottleneck edge queries. We introduce a cache-oblivious Cartesian tree for solving the ran...
Erik D. Demaine, Gad M. Landau, Oren Weimann
ESANN
2006
13 years 10 months ago
Unsupervised clustering of continuous trajectories of kinematic trees with SOM-SD
We explore the capability of the Self Organizing Map for structured data (SOM-SD) to compress continuous time data recorded from a kinematic tree, which can represent a robot or an...
Jochen J. Steil, Risto Koiva, Alessandro Sperduti
PG
2002
IEEE
14 years 1 months ago
A Divide and Conquer Algorithm for Triangle Mesh Connectivity Encoding
We propose a divide and conquer algorithm for the single resolution encoding of triangle mesh connectivity. Starting from a boundary edge we grow a zig-zag strip which divides the...
Ioannis P. Ivrissimtzis, Christian Rössl, Han...