Sciweavers

3455 search results - page 430 / 691
» Generalized Game Trees
Sort
View
DAM
2007
107views more  DAM 2007»
15 years 6 months ago
Eliminating graphs by means of parallel knock-out schemes
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
Hajo Broersma, Fedor V. Fomin, Rastislav Kralovic,...
BMCBI
2011
15 years 1 months ago
N-gram analysis of 970 microbial organisms reveals presence of biological language models
Background: It has been suggested previously that genome and proteome sequences show characteristics typical of natural-language texts such as “signature-style” word usage ind...
Hatice U. Osmanbeyoglu, Madhavi Ganapathiraju
DEXA
2004
Springer
190views Database» more  DEXA 2004»
16 years 2 days ago
On Efficient and Effective Association Rule Mining from XML Data
: 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...
Ji Zhang, Tok Wang Ling, Robert M. Bruckner, A. Mi...
WWW
2009
ACM
16 years 7 months ago
Automated synthesis of composite services with correctness guarantee
In this paper, we propose a novel approach for composing existing web services to satisfy the correctness constraints to the design, including freeness of deadlock and unspecified...
Ting Deng, Jinpeng Huai, Xianxian Li, Zongxia Du, ...
WWW
2005
ACM
16 years 7 months ago
Delivering new web content reusing remote and heterogeneous sites. A DOM-based approach
This contribution addresses the development of new web sites reusing already existing contents from external sources. Unlike common links to other resources, which retrieves the w...
Luis Álvarez Sabucedo, Luis E. Anido-Rif&oa...