1243 search results - page 136 / 249 » Generating Trees on Multisets |
JCT
2011
14 years 5 months ago
2011
The descendant set desc(α) of a vertex α in a digraph D is the set of vertices which can be reached by a directed path from α. A subdigraph of D is finitely generated if it is...
CADE
2001
Springer
15 years 10 months ago
2001
Springer
We present a tool deciding a fragment of set theory. It is designed to be easily accessible via the internet and intuitively usable by anyone who is working with sets to describe a...
FOIKS
2010
Springer
15 years 4 months ago
2010
Springer
A. Falappa, an Abstract Dialogue Framework Guillermo R. Simari Regular Helena Kein¨anen An Algorithm for Generating Nash Stable Coalition Structures in Hedonic Games 15:30-16:00 A...
ICDM
2006
IEEE
15 years 4 months ago
2006
IEEE
Mining graph databases for frequent subgraphs has recently developed into an area of intensive research. Its main goals are to reduce the execution time of the existing basic algo...
TSD
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. A formal prosody description framework is introduced together with its relation to language semantics and NLP. The framework incorporates deep prosodic structures based o...