Sciweavers

199 search results - page 26 / 40
» Fast Algorithms for Computing Tree LCS
Sort
View
166
Voted
DAC
2008
ACM
16 years 7 months ago
DeFer: deferred decision making enabled fixed-outline floorplanner
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...
Jackey Z. Yan, Chris Chu
225
Voted

Publication
303views
17 years 5 months ago
Automatic Ascending Aorta Detection in CTA Datasets
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...
Stefan C. Saur, Caroline Kühnel, Tobias Boska...
182
Voted
IPPS
2010
IEEE
15 years 4 months ago
A scalable algorithm for maintaining perpetual system connectivity in dynamic distributed systems
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...
Tarun Bansal, Neeraj Mittal
176
Voted
CVPR
2007
IEEE
16 years 8 months ago
Learning Visual Similarity Measures for Comparing Never Seen Objects
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 ...
Eric Nowak, Frédéric Jurie
ECML
2006
Springer
15 years 10 months ago
Approximate Policy Iteration for Closed-Loop Learning of Visual Tasks
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...
Sébastien Jodogne, Cyril Briquet, Justus H....