4911 search results - page 517 / 983 » Tree dependence analysis |
184
click to vote
WG
2005
Springer
16 years 12 days ago
2005
Springer
We prove that for all 0 ≤ t ≤ k and d ≥ 2k, every graph G with treewidth at most k has a ‘large’ induced subgraph H, where H has treewidth at most t and every vertex in ...
216
click to vote
DEXA
2004
Springer
16 years 9 days ago
2004
Springer
: In this paper, we propose a framework, called XAR-Miner, for mining ARs from XML documents efficiently and effectively. In XAR-Miner, raw XML data are first transformed to either...
182
click to vote
MABS
2004
Springer
16 years 8 days ago
2004
Springer
The efficient simulation of multi-agent systems presents particular challenges which are not addressed by current parallel discrete event simulation (PDES) models and techniques. ...
168
click to vote
ECML
2003
Springer
16 years 4 days ago
2003
Springer
We present an algorithm for learning context free grammars from positive structural examples (unlabeled parse trees). The algorithm receives a parameter in the form of a finite se...
173
Voted
GCB
2003
Springer
16 years 4 days ago
2003
Springer
The further development of analytical techniques based on gas chromatography and mass spectrometry now facilitate the generation of larger sets of metabolite concentration data. T...