199 search results - page 26 / 40 » Fast Algorithms for Computing Tree LCS |
102
click to vote
DAC
2008
ACM
16 years 21 days ago
2008
ACM
In this paper, we present DeFer -- a fast, high-quality and nonstochastic fixed-outline floorplanning algorithm. DeFer generates a non-slicing floorplan by compacting a slicing fl...
116
click to vote
Publication
The assessment of coronary arteries is an essential step when diagnosing coronary heart diseases. There exists a wide range of specialized algorithms for the segmentation of the co...
IPPS
2010
IEEE
14 years 9 months ago
2010
IEEE
We investigate the problem of maintaining a topology with small degree as well as small diameter in a dynamic distributed system such that the system always stays connected and pr...
CVPR
2007
IEEE
16 years 1 months ago
2007
IEEE
In this paper we propose and evaluate an algorithm that learns a similarity measure for comparing never seen objects. The measure is learned from pairs of training images labeled ...
ECML
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. Approximate Policy Iteration (API) is a reinforcement learning paradigm that is able to solve high-dimensional, continuous control problems. We propose to exploit API for...