Sciweavers

9842 search results - page 1630 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
EVOW
2007
Springer
16 years 26 days ago
Unsupervised Evolutionary Segmentation Algorithm Based on Texture Analysis
Abstract. This work describes an evolutionary approach to texture segmentation, a long-standing and important problem in computer vision. The difficulty of the problem can be relat...
Cynthia B. Pérez, Gustavo Olague
GECCO
2007
Springer
558views Optimization» more  GECCO 2007»
16 years 26 days ago
A chain-model genetic algorithm for Bayesian network structure learning
Bayesian Networks are today used in various fields and domains due to their inherent ability to deal with uncertainty. Learning Bayesian Networks, however is an NP-Hard task [7]....
Ratiba Kabli, Frank Herrmann, John McCall
ICANN
2007
Springer
16 years 26 days ago
Inferring Cognition from fMRI Brain Images
Abstract. Over the last few years, functional Magnetic Resonance Imaging (fMRI) has emerged as a new and powerful method to map the cognitive states of a human subject to specific...
Diego Sona, Sriharsha Veeramachaneni, Emanuele Oli...
ICDT
2007
ACM
141views Database» more  ICDT 2007»
16 years 26 days ago
Exact XML Type Checking in Polynomial Time
Stay macro tree transducers (smtts) are an expressive formalism for reasoning about XSLT-like document transformations. Here, we consider the exact type checking problem for smtts....
Sebastian Maneth, Thomas Perst, Helmut Seidl
ILP
2007
Springer
16 years 26 days ago
ILP : - Just Trie It
Abstract. Despite the considerable success of Inductive Logic Programming, deployed ILP systems still have efficiency problems when applied to complex problems. Several techniques ...
Rui Camacho, Nuno A. Fonseca, Ricardo Rocha, V&iac...
« Prev « First page 1630 / 1969 Last » Next »