Sciweavers

2127 search results - page 352 / 426
» Computing large matchings fast
Sort
View
MICCAI
2009
Springer
16 years 6 months ago
Accelerating Feature Based Registration Using the Johnson-Lindenstrauss Lemma
We introduce an efficient search strategy to substantially accelerate feature based registration. Previous feature based registration algorithms often use truncated search strategi...
Ayelet Akselrod-Ballin, Davi Bock, R. Clay Reid,...
DAC
2008
ACM
16 years 6 months ago
Concurrent topology and routing optimization in automotive network integration
In this paper, a novel automatic approach for the concurrent topology and routing optimization that achieves a high quality network layout is proposed. This optimization is based ...
Bardo Lang, Christian Haubelt, Jürgen Teich, ...
MICCAI
2007
Springer
16 years 6 months ago
Automatic Fetal Measurements in Ultrasound Using Constrained Probabilistic Boosting Tree
Abstract. Automatic delineation and robust measurement of fetal anatomical structures in 2D ultrasound images is a challenging task due to the complexity of the object appearance, ...
Gustavo Carneiro, Bogdan Georgescu, Sara Good, Dor...
DATE
2008
IEEE
103views Hardware» more  DATE 2008»
15 years 12 months ago
Novel Pin Assignment Algorithms for Components with Very High Pin Counts
The wiring effort and thus, the routability of electronic designs such as printed circuit boards, multi chip modules and single chip modules largely depends on the assignment of s...
Tilo Meister, Jens Lienig, Gisbert Thomke
ICASSP
2008
IEEE
15 years 12 months ago
Wavelet-domain compressive signal reconstruction using a Hidden Markov Tree model
Compressive sensing aims to recover a sparse or compressible signal from a small set of projections onto random vectors; conventional solutions involve linear programming or greed...
Marco F. Duarte, Michael B. Wakin, Richard G. Bara...