Sciweavers

17770 search results - page 99 / 3554
» A Generalization of Forward-Backward Algorithm
Sort
View
FOCS
1991
IEEE
15 years 1 months ago
A General Approach to Removing Degeneracies
We wish to increase the power of an arbitrary algorithm designed for non-degenerate input, by allowing it to execute on all inputs. We concentrate on in nitesimal symbolic perturba...
Ioannis Z. Emiris, John F. Canny
PAMI
2007
154views more  PAMI 2007»
14 years 9 months ago
Graph Embedding and Extensions: A General Framework for Dimensionality Reduction
—Over the past few decades, a large family of algorithms—supervised or unsupervised; stemming from statistics or geometry theory—has been designed to provide different soluti...
Shuicheng Yan, Dong Xu, Benyu Zhang, HongJiang Zha...
SIAMMAX
2010
76views more  SIAMMAX 2010»
14 years 4 months ago
Matrix Structures and Parallel Algorithms for Image Superresolution Reconstruction
Computational resolution enhancement (superresolution) is generally regarded as a memory intensive process due to the large matrix-vector calculations involved. In this paper, a de...
Qiang Zhang, Richard T. Guy, Robert J. Plemmons
STOC
2005
ACM
130views Algorithms» more  STOC 2005»
15 years 10 months ago
Low-distortion embeddings of general metrics into the line
A low-distortion embedding between two metric spaces is a mapping which preserves the distances between each pair of points, up to a small factor called distortion. Low-distortion...
Mihai Badoiu, Julia Chuzhoy, Piotr Indyk, Anastasi...
SODA
1992
ACM
252views Algorithms» more  SODA 1992»
14 years 11 months ago
A General Approximation Technique for Constrained Forest Problems
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
Michel X. Goemans, David P. Williamson