1805 search results - page 255 / 361 » Functional programming with structured graphs |
CIDM
2007
IEEE
15 years 5 months ago
2007
IEEE
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 ...
144
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Predicting the occurrence of links is a fundamental problem in networks. In the link prediction problem we are given a snapshot of a network and would like to infer which interact...
86
Voted
UAI
1996
15 years 2 months ago
1996
Probabilistic inference algorithms for belief updating, nding the most probable explanation, the maximum a posteriori hypothesis, and the maximum expected utility are reformulated...
87
Voted
EUROGP
2009
Springer
15 years 8 months ago
2009
Springer
This paper analyses the efficiency of the Cartesian Genetic Programming (CGP) methodology in the image operator design problem at the functional level. The CGP algorithm is compare...
110
Voted
ECCV
2010
Springer
15 years 6 months ago
2010
Springer
We present a novel dual decomposition approach to MAP inference with highly connected discrete graphical models. Decompositions into cyclic k-fan structured subproblems are shown t...