925 search results - page 147 / 185 » Connectivity on Complete Lattices |
TNN
1998
13 years 7 months ago
1998
— In this paper, we perform a complete asymptotic performance analysis of the stochastic approximation algorithm (denoted subspace network learning algorithm) derived from Oja’...
TOG
2002
13 years 7 months ago
2002
Surface geometry is often modeled with irregular triangle meshes. The process of remeshing refers to approximating such geometry using a mesh with (semi)-regular connectivity, whi...
IJAR
2010
13 years 5 months ago
2010
The logical and algorithmic properties of stable conditional independence (CI) as an alternative structural representation of conditional independence information are investigated...
JCT
2010
13 years 5 months ago
2010
An Avoider-Enforcer game is played by two players, called Avoider and Enforcer, on a hypergraph F ⊆ 2X . The players claim previously unoccupied elements of the board X in turns...
JDA
2010
13 years 5 months ago
2010
: Hierarchical graphs are graphs with layering structures; clustered graphs are graphs with recursive clustering structures. Both have applications in VLSI design, CASE tools, soft...