5115 search results - page 209 / 1023 » On Randomized Lanczos Algorithms |
253
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
In this paper, we present a semi-automated method for converting conventional 2D images to stereoscopic 3D. User-defined strokes that correspond to a rough estimate of the depth ...
197
Voted
CORR
2010
Springer
15 years 7 months ago
2010
Springer
The MUSIC algorithm, and its extension for imaging sparse extended objects, with noisy data is analyzed by compressed sensing (CS) techniques. A thresholding rule is developed to a...
189
click to vote
STACS
2005
Springer
16 years 13 days ago
2005
Springer
Abstract Abstract. Recent work in the analysis of randomized approximation algorithms for NP-hard optimization problems has involved approximating the solution to a problem by the ...
215
Voted
SAC
2003
ACM
16 years 6 days ago
2003
ACM
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...
170
Voted
DAC
1995
ACM
15 years 10 months ago
1995
ACM
—DARWIN is a tool that is able to synthesize CMOS opamps, on the basis of a genetic algorithm. A randomly generated initial set of opamps evolves to a set in which the topologies...