Sciweavers

312 search results - page 26 / 63
» An experimental study on algorithms for drawing binary trees
Sort
View
CORR
2006
Springer
153views Education» more  CORR 2006»
13 years 7 months ago
Genetic Programming, Validation Sets, and Parsimony Pressure
Fitness functions based on test cases are very common in Genetic Programming (GP). This process can be assimilated to a learning task, with the inference of models from a limited n...
Christian Gagné, Marc Schoenauer, Marc Pari...
AI
2011
Springer
13 years 2 months ago
Contracting preference relations for database applications
The binary relation framework has been shown to be applicable to many real-life preference handling scenarios. Here we study preference contraction: the problem of discarding sele...
Denis Mindolin, Jan Chomicki
VLDB
2002
ACM
133views Database» more  VLDB 2002»
14 years 7 months ago
Tree pattern query minimization
: Purpose ? Tree pattern is at the core of XML queries. The tree patterns in XML queries typically contain redundancies, especially when broad integrity constraints (ICs) are prese...
Sihem Amer-Yahia, SungRan Cho, Laks V. S. Lakshman...
WWW
2008
ACM
14 years 8 months ago
Race: finding and ranking compact connected trees for keyword proximity search over xml documents
In this paper, we study the problem of keyword proximity search over XML documents and leverage the efficiency and effectiveness. We take the disjunctive semantics among input key...
Guoliang Li, Jianhua Feng, Jianyong Wang, Bei Yu, ...
CIBCB
2009
IEEE
13 years 8 months ago
A framework for the application of decision trees to the analysis of SNPs data
Data mining is the analysis of experimental datasets to extract trends and relationships that can be meaningful for the user. In genetic studies these techniques have revealed inte...
Linda Fiaschi, Jonathan M. Garibaldi, Natalio Kras...