Sciweavers

3265 search results - page 548 / 653
» Representing Groups on Graphs
Sort
View
NN
1997
Springer
174views Neural Networks» more  NN 1997»
15 years 10 months ago
Learning Dynamic Bayesian Networks
Bayesian networks are directed acyclic graphs that represent dependencies between variables in a probabilistic model. Many time series models, including the hidden Markov models (H...
Zoubin Ghahramani
CIDM
2007
IEEE
15 years 10 months ago
Efficient Kernel-based Learning for Trees
Kernel methods are effective approaches to the modeling of structured objects in learning algorithms. Their major drawback is the typically high computational complexity of kernel ...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...
169
Voted
EUROPAR
2007
Springer
15 years 9 months ago
Efficient Parallel Simulation of Large-Scale Neuronal Networks on Clusters of Multiprocessor Computers
To understand the principles of information processing in the brain, we depend on models with more than 105 neurons and 109 connections. These networks can be described as graphs o...
Hans E. Plesser, Jochen M. Eppler, Abigail Morriso...
155
Voted
EVOW
2009
Springer
15 years 9 months ago
A Hierarchical Classification Ant Colony Algorithm for Predicting Gene Ontology Terms
Abstract. This paper proposes a novel Ant Colony Optimisation algorithm for the hierarchical problem of predicting protein functions using the Gene Ontology (GO). The GO structure ...
Fernando E. B. Otero, Alex Alves Freitas, Colin G....
CAISE
2004
Springer
15 years 9 months ago
Simple and Minimum-Cost Satisfiability for Goal Models
Abstract. Goal models have been used in Computer Science in order to represent software requirements, business objectives and design qualities. In previous work we have presented a...
Roberto Sebastiani, Paolo Giorgini, John Mylopoulo...