Sciweavers

3630 search results - page 558 / 726
» Fast Marching Methods
Sort
View
122
Voted
ICIG
2009
IEEE
15 years 10 months ago
Image Segmentation Via Iterative Geodesic Averaging
We present a simple and fast method for performing unsupervised segmentation. Our method works by centering a square window on each pixel of the input image. Each pixel is then as...
Asmaa Hosni, Michael Bleyer, Margrit Gelautz
CASES
2003
ACM
15 years 8 months ago
Compiler-decided dynamic memory allocation for scratch-pad based embedded systems
This paper presents a highly predictable, low overhead and yet dynamic, memory allocation strategy for embedded systems with scratch-pad memory. A scratch-pad is a fast compiler-m...
Sumesh Udayakumaran, Rajeev Barua
120
Voted
ASIACRYPT
2006
Springer
15 years 7 months ago
Extending Scalar Multiplication Using Double Bases
Abstract. It has been recently acknowledged [4, 6, 9] that the use of double bases representations of scalars n, that is an expression of the form n = e,s,t(-1)e As Bt can speed up...
Roberto Maria Avanzi, Vassil S. Dimitrov, Christop...
169
Voted
JPDC
2008
138views more  JPDC 2008»
15 years 3 months ago
Efficient parallel implementation of iterative reconstruction algorithms for electron tomography
Electron tomography (ET) combines electron microscopy and the principles of tomographic imaging in order to reconstruct the threedimensional structure of complex biological specim...
José-Jesús Fernández, Dan Gor...
136
Voted
SIGIR
2008
ACM
15 years 3 months ago
Learning to rank at query-time using association rules
Some applications have to present their results in the form of ranked lists. This is the case of many information retrieval applications, in which documents must be sorted accordi...
Adriano Veloso, Humberto Mossri de Almeida, Marcos...