Sciweavers

60 search results - page 4 / 12
» A Separator Theorem for String Graphs and its Applications
Sort
View
GC
2006
Springer
13 years 6 months ago
The Semi-Arc Automorphism Group of a Graph with Application to Map Enumeration
A map is a connected topological graph cellularly embedded in a surface. For a given graph , its genus distribution of rooted maps and embeddings on orientable and non-orientable s...
Linfan Mao, Yanpei Liu, Erling Wei
GG
2010
Springer
13 years 7 months ago
Multi-Amalgamation in Adhesive Categories
Abstract. Amalgamation is a well-known concept for graph transformations in order to model synchronized parallelism of rules with shared subrules and corresponding transformations....
Ulrike Golas, Hartmut Ehrig, Annegret Habel
AMAI
2004
Springer
14 years 3 days ago
Using the Central Limit Theorem for Belief Network Learning
Learning the parameters (conditional and marginal probabilities) from a data set is a common method of building a belief network. Consider the situation where we have known graph s...
Ian Davidson, Minoo Aminian
VR
2002
IEEE
210views Virtual Reality» more  VR 2002»
13 years 11 months ago
Distributed Applications for Collaborative Augmented Reality
This paper focuses on the distributed architecture of the collaborative augmented reality system Studierstube. The system allows multiple users to experience a shared 3D workspace...
Dieter Schmalstieg, Gerd Hesina
BIRTHDAY
2010
Springer
13 years 7 months ago
Choiceless Computation and Symmetry
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
Benjamin Rossman