Sciweavers

4305 search results - page 727 / 861
» The Test of Time
Sort
View
IJAR
2010
75views more  IJAR 2010»
15 years 5 months ago
Generalized loopy 2U: A new algorithm for approximate inference in credal networks
Credal nets generalize Bayesian nets by relaxing the requirement of precision of probabilities. Credal nets are considerably more expressive than Bayesian nets, but this makes bel...
Alessandro Antonucci, Yi Sun, Cassio P. de Campos,...
ISCI
2010
211views more  ISCI 2010»
15 years 4 months ago
A new heuristic approach for non-convex optimization problems
In this work a new optimization method, called the heuristic Kalman algorithm (HKA), is presented. This new algorithm is proposed as an alternative approach for solving continuous,...
Rosario Toscano, Patrick Lyonnet
ISVC
2010
Springer
15 years 4 months ago
Visual Network Analysis of Dynamic Metabolic Pathways
We extend our previous work on the exploration of static metabolic networks to evolving, and therefore dynamic, pathways. We apply our visualization software to data from a simulat...
Markus Rohrschneider, Alexander Ullrich, Andreas K...
JAIR
2010
153views more  JAIR 2010»
15 years 4 months ago
Algorithms for Closed Under Rational Behavior (CURB) Sets
We provide a series of algorithms demonstrating that solutions according to the fundamental game-theoretic solution concept of closed under rational behavior (CURB) sets in two-pl...
Michael Benisch, George B. Davis, Tuomas Sandholm
JMLR
2010
155views more  JMLR 2010»
15 years 4 months ago
Approximate Tree Kernels
Convolution kernels for trees provide simple means for learning with tree-structured data. The computation time of tree kernels is quadratic in the size of the trees, since all pa...
Konrad Rieck, Tammo Krueger, Ulf Brefeld, Klaus-Ro...