5592 search results - page 419 / 1119 » On Random Betweenness Constraints |
164
click to vote
ASUNAM
2010
IEEE
15 years 8 months ago
2010
IEEE
Abstract--We present a novel and efficient algorithm, PATH COVERING, for solving the most reliable subgraph problem. A reliable subgraph gives a concise summary of the connectivity...
194
click to vote
FLAIRS
2004
15 years 8 months ago
2004
ABSURDIST II, an extension to ABSURDIST, is an algorithm using attributed graph matching to find translations between conceptual systems. It uses information about the internal st...
163
click to vote
JUCS
2006
15 years 6 months ago
2006
: We examined the periodicity of the childhood leukaemia in Hungary using seasonal decomposition time series. Between 1988 and 2000 the number of annually diagnosed leukaemia (inci...
173
click to vote
NN
2002
Springer
15 years 6 months ago
2002
Springer
In reinforcement learning (RL), the duality between exploitation and exploration has long been an important issue. This paper presents a new method that controls the balance betwe...
188
click to vote
MICCAI
2010
Springer
15 years 5 months ago
2010
Springer
In this paper, we introduce a novel approach to bridge the gap between the landmark-based and the iconic-based voxel-wise registration methods. The registration problem is formulat...