Sciweavers

16430 search results - page 575 / 3286
» On Computable Tree Functions
Sort
View
SAC
2004
ACM
16 years 16 days ago
An optimized approach for KNN text categorization using P-trees
The importance of text mining stems from the availability of huge volumes of text databases holding a wealth of valuable information that needs to be mined. Text categorization is...
Imad Rahal, William Perrizo
BMCBI
2008
125views more  BMCBI 2008»
15 years 7 months ago
SynteBase/SynteView: a tool to visualize gene order conservation in prokaryotic genomes
Background: It has been repeatedly observed that gene order is rapidly lost in prokaryotic genomes. However, persistent synteny blocks are found when comparing more or less distan...
Frédéric Lemoine, Bernard Labedan, O...
AAAI
1994
15 years 8 months ago
Evolving Neural Networks to Focus Minimax Search
Neural networks were evolved through genetic algorithms to focus minimax search in the game of Othello. At each level of the search tree, the focus networks decide which moves are...
David E. Moriarty, Risto Miikkulainen
EJC
2010
15 years 7 months ago
Partitions versus sets: A case of duality
In a recent paper, Amini et al. introduced a general framework to prove duality theorems between tree decompositions and their dual combinatorial object. They unify all known ad-h...
Laurent Lyaudet, Frédéric Mazoit, St...
COMBINATORICS
2006
124views more  COMBINATORICS 2006»
15 years 7 months ago
A Hybrid of Darboux's Method and Singularity Analysis in Combinatorial Asymptotics
A "hybrid method", dedicated to asymptotic coefficient extraction in combinatorial generating functions, is presented, which combines Darboux's method and singulari...
Philippe Flajolet, Éric Fusy, Xavier Gourdo...