1671 search results - page 234 / 335 » On the Covering Steiner Problem |
165
click to vote
MICCAI
2005
Springer
16 years 6 months ago
2005
Springer
In this paper we present an enhanced method for non-rigid registration of volumetric multi-modal images using Mutual Information (MI). Based on a hierarchical subdivision scheme, t...
159
Voted
ICML
2008
IEEE
16 years 6 months ago
2008
IEEE
In high-dimensional classification problems it is infeasible to include enough training samples to cover the class regions densely. Irregularities in the resulting sparse sample d...
140
click to vote
CAV
2009
Springer
16 years 6 months ago
2009
Springer
Abstract. We study the problem of determining, given a run of a concurrent program, whether there is any alternate execution of it that violates atomicity, where atomicity is defin...
132
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
In this paper, we present the first average-case analysis proving an expected polynomial running time for an exact algorithm for the 0/1 knapsack problem. In particular, we prove,...
153
click to vote
ICCAD
2002
IEEE
16 years 2 months ago
2002
IEEE
In macromodeling-based power estimation, circuit macromodels are created from simulations of synthetic input vector sequences. Fast generation of these sequences with all possible...