Sciweavers

691 search results - page 113 / 139
» Non-negative graph embedding
Sort
View
FUIN
2006
160views more  FUIN 2006»
13 years 8 months ago
Behavioral Pattern Identification Through Rough Set Modeling
This paper introduces an approach to behavioral pattern identification as a part of a study of temporal patterns in complex dynamical systems. Rough set theory introduced by Zdzisl...
Jan G. Bazan
DCG
2007
102views more  DCG 2007»
13 years 7 months ago
How to Exhibit Toroidal Maps in Space
Steinitz’s Theorem states that a graph is the 1-skeleton of a convex polyhedron if and only if it is 3-connected and planar. The polyhedron is called a geometric realization of ...
Dan Archdeacon, C. Paul Bonnington, Joanna A. Elli...
ENDM
2007
106views more  ENDM 2007»
13 years 7 months ago
Removing Even Crossings on Surfaces
In this paper we investigate how certain results related to the HananiTutte theorem can be extended from the plane to surfaces. We give a simple topological proof that the weak Ha...
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stef...
KAIS
2000
131views more  KAIS 2000»
13 years 7 months ago
Intentions in the Coordinated Generation of Graphics and Text from Tabular Data
To use graphics efficiently in an automatic report generation system, one has to model messages and how they go from the writer (intention) to the reader (interpretation). This pap...
Massimo Fasciano, Guy Lapalme
COMBINATORICS
1999
90views more  COMBINATORICS 1999»
13 years 7 months ago
On the Theory of Pfaffian Orientations. II. T-joins, k-cuts, and Duality of Enumeration
This is a continuation of our paper "A Theory of Pfaffian Orientations I: Perfect Matchings and Permanents". We present a new combinatorial way to compute the generating...
Anna Galluccio, Martin Loebl