Sciweavers

1722 search results - page 147 / 345
» Variables in Concept Graphs
Sort
View
DAGSTUHL
2001
14 years 11 months ago
Animating Algorithms Live and Post Mortem
We first give an overview of the features of the GANIMAL Framework introducing several new concepts not present in any previous algorithm animation system. Then we focus on its me...
Stephan Diehl, Carsten Görg, Andreas Kerren
CCCG
2003
14 years 11 months ago
Degree Bounds for Constrained Pseudo-Triangulations
We introduce the concept of a constrained pointed pseudo-triangulation TG of a point set S with respect to a pointed planar straight line graph G = (S, E). For the case that G for...
Oswin Aichholzer, Michael Hoffmann, Bettina Speckm...
WSC
1997
14 years 11 months ago
Visualize a Port in Africa
Techniques to visualize quantitative discrete event simulation input and output data are presented. General concepts connected with graphical excellence are discussed in a simulat...
James N. Robinson
ORL
2006
103views more  ORL 2006»
14 years 10 months ago
Reduction tests for the prize-collecting Steiner problem
This article introduces a proper redefinition of the concept of bottleneck Steiner distance for the Prize-Collecting Steiner Problem. This allows the application of reduction test...
Eduardo Uchoa
ARSCOM
2004
175views more  ARSCOM 2004»
14 years 10 months ago
Circular Chromatic Number of Hypergraphs
The concept of circular chromatic number of graphs was introduced by Vince(1988). In this paper we define circular chromatic number of uniform hypergraphs and study their basic pr...
Changiz Eslahchi, Arash Rafiey