Sciweavers

2157 search results - page 69 / 432
» Optimal Fast Hashing
Sort
View
ISBI
2009
IEEE
15 years 11 months ago
Fast Algorithms for Nonconvex Compressive Sensing: MRI Reconstruction from Very Few Data
Compressive sensing is the reconstruction of sparse images or signals from very few samples, by means of solving a tractable optimization problem. In the context of MRI, this can ...
Rick Chartrand
150
Voted
DC
2006
15 years 4 months ago
Fast Paxos
Abstract. Paxos and Fast Paxos are optimal consensus algorithms that are simple and elegant, while suitable for efficient implementation. In this paper, we compare the performance ...
Leslie Lamport
104
Voted
ICPR
2006
IEEE
16 years 5 months ago
Fast Dichotomic Multiple Search Algorithm for Shortest Cirular Path
Circular shortest path algorithms for polar objects segmentation have been proposed in [1, 11, 10] to address discrete case and extended in [2] to the continuous domain for closed...
Martin de La Gorce, Nikos Paragios
CASES
2006
ACM
15 years 10 months ago
Automatic performance model construction for the fast software exploration of new hardware designs
Developing an optimizing compiler for a newly proposed architecture is extremely difficult when there is only a simulator of the machine available. Designing such a compiler requ...
John Cavazos, Christophe Dubach, Felix V. Agakov, ...
MOC
1998
96views more  MOC 1998»
15 years 3 months ago
Fast solvers of integral and pseudodifferential equations on closed curves
On the basis of a fully discrete trigonometric Galerkin method and two grid iterations we propose solvers for integral and pseudodifferential equations on closed curves which solv...
Jukka Saranen, Gennadi Vainikko