Sciweavers

9659 search results - page 1729 / 1932
» Points on Computable Curves
Sort
View
STOC
2009
ACM
168views Algorithms» more  STOC 2009»
16 years 7 months ago
Fault-tolerant spanners for general graphs
The paper concerns graph spanners that are resistant to vertex or edge failures. Given a weighted undirected n-vertex graph G = (V, E) and an integer k 1, the subgraph H = (V, E ...
Shiri Chechik, Michael Langberg, David Peleg, Liam...
ICCV
2009
IEEE
16 years 11 months ago
Light Field Video Stabilization
We describe a method for producing a smooth, stabilized video from the shaky input of a hand-held light field video camera— specifically, a small camera array. Traditional stab...
Brandon M. Smith, Li Zhang, Hailin Jin, Aseem Agar...
ICCV
2007
IEEE
16 years 8 months ago
Feature Preserving Image Smoothing Using a Continuous Mixture of Tensors
Many computer vision and image processing tasks require the preservation of local discontinuities, terminations and bifurcations. Denoising with feature preservation is a challeng...
Özlem N. Subakan, Bing Jian, Baba C. Vemuri, ...
ICCV
2001
IEEE
16 years 8 months ago
Noise in Bilinear Problems
: Despite the wide application of bilinear problems to problems both in computer vision and in other fields, their behaviour under the effects of noise is still poorly understood. ...
John A. Haddon, David A. Forsyth
ECCV
2006
Springer
16 years 8 months ago
EMD-L1: An Efficient and Robust Algorithm for Comparing Histogram-Based Descriptors
We propose a fast algorithm, EMD-L1, for computing the Earth Mover's Distance (EMD) between a pair of histograms. Compared to the original formulation, EMD-L1 has a largely si...
Haibin Ling, Kazunori Okada
« Prev « First page 1729 / 1932 Last » Next »