Sciweavers

1512 search results - page 251 / 303
» connection 2006
Sort
View
ACTA
2006
104views more  ACTA 2006»
15 years 4 months ago
Safe projections of binary data sets
Abstract Selectivity estimation of a boolean query based on frequent itemsets can be solved by describing the problem by a linear program. However, the number of variables in the e...
Nikolaj Tatti
AI
2006
Springer
15 years 4 months ago
Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering
This article presents and analyzes algorithms that systematically generate random Bayesian networks of varying difficulty levels, with respect to inference using tree clustering. ...
Ole J. Mengshoel, David C. Wilkins, Dan Roth
ALGORITHMICA
2006
138views more  ALGORITHMICA 2006»
15 years 4 months ago
Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths Make It Difficult
We consider the problem of coloring a planar graph with the minimum number of colors so that each color class avoids one or more forbidden graphs as subgraphs. We perform a detail...
Hajo Broersma, Fedor V. Fomin, Jan Kratochví...
ALGORITHMICA
2006
100views more  ALGORITHMICA 2006»
15 years 4 months ago
Error Compensation in Leaf Power Problems
The k-Leaf Power recognition problem is a particular case of graph power problems: For a given graph it asks whether there exists an unrooted tree--the k-leaf root--with leaves on...
Michael Dom, Jiong Guo, Falk Hüffner, Rolf Ni...
ALIFE
2006
15 years 4 months ago
Evolving Physically Simulated Flying Creatures for Efficient Cruising
The body-brain coevolution of aerial life forms has not been developed as far as aquatic or terrestrial locomotion in the field of artificial life. We are studying physically simu...
Yoon-Sik Shim, Chang-Hun Kim