Sciweavers

3630 search results - page 127 / 726
» Fast Marching Methods
Sort
View
124
Voted
INTEGRATION
2007
69views more  INTEGRATION 2007»
15 years 2 months ago
A fast algorithm for rectilinear block packing based on selected sequence-pair
In this paper, we present a method of rectilinear block packing using selected sequence-pair (SSP), a rectangle packing representation. We also propose a fast algorithm to obtain ...
Kunihiro Fujiyoshi, Chikaaki Kodama, Akira Ikeda
322
Voted
ICDAR
2011
IEEE
14 years 2 months ago
Fast Key-Word Searching via Embedding and Active-DTW
—In this paper we present a novel approach for fast search of handwritten Arabic word-parts within large lexicons. The algorithm runs through three steps to achieve the required ...
Raid Saabni, Alex Bronstein
112
Voted
ISBI
2008
IEEE
16 years 3 months ago
Multi-resolution parallel integral projection for fast localization of a straight electrode in 3D ultrasound images
We address the problem of fast and accurate localization of miniature surgical instruments like needles or electrodes using 3D ultrasound (US). An algorithm based on maximizing a ...
Christian Cachard, Hervé Liebgott, Jan Kybi...
98
Voted
ICCAD
2006
IEEE
131views Hardware» more  ICCAD 2006»
15 years 11 months ago
Fast wire length estimation by net bundling for block placement
The wire length estimation is the bottleneck of packing based block placers. To cope with this problem, we present a fast wire length estimation method in this paper. The key idea...
Tan Yan, Hiroshi Murata
111
Voted
ICMCS
2008
IEEE
138views Multimedia» more  ICMCS 2008»
15 years 9 months ago
Using H.264 coded block patterns for fast inter-mode selection
The support of variable block-sizes, though significantly improves the compression efficiency, imposes a big computational challenge on an H.264 encoder. In this paper, we present...
Bo-Yuan Chen, Shih-Hsuan Yang