3630 search results - page 298 / 726 » Fast Marching Methods |
161
Voted
VTC
2006
IEEE
16 years 12 days ago
2006
IEEE
Abstract-In fast time varying systems, the problem of acquiring the channel coefficients required for symbol decoding commonly arises. A method of resolving this problem is the use...
126
click to vote
ICCAD
1996
IEEE
15 years 10 months ago
1996
IEEE
A number of methods are presentedfor highly efficient calculation of substratecurrenttransport. A three-dimensionalGreen'sFunction based substrate representation, in combinat...
186
click to vote
IWMM
2000
Springer
15 years 10 months ago
2000
Springer
Dynamic memory allocation is an important part of modern programming languages. It is important that it be done fast without wasting too much memory. Memory allocation using lazy ...
115
click to vote
BILDMED
2008
15 years 7 months ago
2008
We present an algorithm for fast automatic registration of spatially overlapping radiographs. It possesses strong robustness against noise, feature masking and feature displacement...
187
click to vote
ECCV
2010
Springer
15 years 6 months ago
2010
Springer
This paper presents a new method for 2-D and 3-D shape retrieval based on geodesic signatures. These signatures are high dimensional statistical distributions computed by extractin...