Sciweavers

970 search results - page 87 / 194
» On encodings of spanning trees
Sort
View
CORR
2010
Springer
168views Education» more  CORR 2010»
13 years 6 months ago
Bounds on the maximum multiplicity of some common geometric graphs
We obtain new lower and upper bounds for the maximum multiplicity of some weighted and, respectively, non-weighted common geometric graphs drawn on n points in the plane in genera...
Adrian Dumitrescu, André Schulz, Adam Sheff...
MFCS
2007
Springer
14 years 3 months ago
Transition Graphs of Rewriting Systems over Unranked Trees
We investigate algorithmic properties of infinite transition graphs that are generated by rewriting systems over unranked trees. Two kinds of such rewriting systems are studied. ...
Christof Löding, Alex Spelten
VIS
2004
IEEE
116views Visualization» more  VIS 2004»
14 years 10 months ago
Simplifying Flexible Isosurfaces Using Local Geometric Measures
our tree, an abstraction of a scalar field that encodes the nesting relationships of isosurfaces, can be used to accelerate isosurface extraction, to identify important isovalues ...
Hamish Carr, Jack Snoeyink, Michiel van de Panne
VMCAI
2007
Springer
14 years 3 months ago
Shape Analysis of Single-Parent Heaps
We define the class of single-parent heap systems, which rely on a singly-linked heap in order to model destructive updates on tree structures. This encoding has the advantage of ...
Ittai Balaban, Amir Pnueli, Lenore D. Zuck
ISNN
2004
Springer
14 years 2 months ago
Evolving Flexible Neural Networks Using Ant Programming and PSO Algorithm
A flexible neural network (FNN) is a multilayer feedforward neural network with the characteristics of: (1) overlayer connections; (2) variable activation functions for different...
Yuehui Chen, Bo Yang, Jiwen Dong