Sciweavers

199 search results - page 18 / 40
» Recognizing HHDS-Free Graphs
Sort
View
GTTSE
2007
Springer
14 years 4 months ago
Automated Merging of Feature Models Using Graph Transformations
Abstract. Feature Models (FMs) are a key artifact for variability and commonality management in Software Product Lines (SPLs). In this context, the merging of FMs is being recogniz...
Sergio Segura, David Benavides, Antonio Ruiz Cort&...
AROBOTS
2011
13 years 4 months ago
Human motion database with a binary tree and node transition graphs
— Database of human motion has been widely used for recognizing human motion and synthesizing humanoid motions. In this paper, we propose a data structure for storing and extract...
Katsu Yamane, Yoshifumi Yamaguchi, Yoshihiko Nakam...
DAC
2001
ACM
14 years 10 months ago
Factoring and Recognition of Read-Once Functions using Cographs and Normality
An approach for factoring general boolean functions was described in [15, 16] which is based on graph partitioning algorithms. In this paper, we present a very fast algorithm for ...
Martin Charles Golumbic, Aviad Mintz, Udi Rotics
JAL
2006
114views more  JAL 2006»
13 years 9 months ago
A wide-range algorithm for minimal triangulation from an arbitrary ordering
We present a new algorithm, called LB-Triang, which computes minimal triangulations. We give both a straightforward O(nm0) time implementation and a more involved O(nm) time imple...
Anne Berry, Jean Paul Bordat, Pinar Heggernes, Gen...
HT
1991
ACM
14 years 1 months ago
Implementing Hypertext Database Relationships through Aggregations and Exceptions
In order to combine hypertext with database facilities, we show how to extract an effective storage structure from given instance relationships. The schema of the structure recogn...
Yoshinori Hara, Arthur M. Keller, Gio Wiederhold