Sciweavers

1108 search results - page 115 / 222
» Algorithm Transformation for FPGA Implementation
Sort
View
ICIP
2003
IEEE
16 years 3 months ago
Algorithms for stochastic approximations of curvature flows
Curvature flows have been extensively considered from a deterministic point of view. They have been shown to be useful for a number of applications including crystal growth, flame...
Gozde B. Unal, Delphine Nain, G. Ben-Arous, Nahum ...
115
Voted
ECCV
2002
Springer
16 years 4 months ago
A Comparison of Search Strategies for Geometric Branch and Bound Algorithms
Over the last decade, a number of methods for geometric matching based on a branch-and-bound approach have been proposed. Such algorithms work by recursively subdividing transforma...
Thomas M. Breuel
GD
2003
Springer
15 years 7 months ago
Intersection-Free Morphing of Planar Graphs
Given two different drawings of a planar graph we consider the problem of morphing one drawing into the other. We designed and implemented an algorithm for intersection-free morph...
Cesim Erten, Stephen G. Kobourov, Chandan Pitta
85
Voted
ICIP
2004
IEEE
16 years 3 months ago
Statistical solution to watershed over-segmentation
A region based algorithm for segmentation motivated by a parallel implementation is introduced. It is obtained by combining the watershed transform with further merging based on a...
Valentin Gies, Thierry M. Bernard
DAC
2003
ACM
16 years 3 months ago
Optimal integer delay budgeting on directed acyclic graphs
Delay budget is an excess delay each component of a design can tolerate under a given timing constraint. Delay budgeting has been widely exploited to improve the design quality. W...
Elaheh Bozorgzadeh, Soheil Ghiasi, Atsushi Takahas...