Sciweavers

101 search results - page 3 / 21
» Fast approximation of the permanent for very dense problems
Sort
View
ECCV
2006
Springer
14 years 9 months ago
A Fast Line Segment Based Dense Stereo Algorithm Using Tree Dynamic Programming
Many traditional stereo correspondence methods emphasized on utilizing epipolar constraint and ignored the information embedded in inter-epipolar lines. Actually some researchers h...
Yi Deng, Xueyin Lin
PAMI
2011
13 years 2 months ago
Large Displacement Optical Flow: Descriptor Matching in Variational Motion Estimation
—Optical flow estimation is classically marked by the requirement of dense sampling in time. While coarse-to-fine warping schemes have somehow relaxed this constraint, there is...
Thomas Brox, Jitendra Malik
CIAC
2000
Springer
121views Algorithms» more  CIAC 2000»
13 years 11 months ago
An Efficient Algorithm for the Approximate Median Selection Problem
We present an efficient algorithm for the approximate median selection problem. The algorithm works in-place; it is fast and easy to implement. For a large array it returns, with ...
Sebastiano Battiato, Domenico Cantone, Dario Catal...
STOC
2009
ACM
271views Algorithms» more  STOC 2009»
14 years 8 months ago
A fast and efficient algorithm for low-rank approximation of a matrix
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
Nam H. Nguyen, Thong T. Do, Trac D. Tran
PC
2008
119views Management» more  PC 2008»
13 years 7 months ago
Atomic wavefunction initialization in ab initio
We present a distributed scheme for initialization from atomic wavefunctions in ab initio molecular dynamics simulations. Good initial guesses for approximate wavefunctions are ve...
Constantine Bekas, Alessandro Curioni, Wanda Andre...