Sciweavers

1054 search results - page 40 / 211
» Fast Approximated SIFT
Sort
View
TCSV
2008
131views more  TCSV 2008»
14 years 9 months ago
Fast Optimal Motion Estimation Based on Gradient-Based Adaptive Multilevel Successive Elimination
In this paper, we propose a fast and optimal solution for block motion estimation based on an adaptive multilevel successive elimination algorithm. This algorithm is accomplished b...
Shao-Wei Liu, Shou-Der Wei, Shang-Hong Lai
ICML
2008
IEEE
15 years 10 months ago
Training restricted Boltzmann machines using approximations to the likelihood gradient
A new algorithm for training Restricted Boltzmann Machines is introduced. The algorithm, named Persistent Contrastive Divergence, is different from the standard Contrastive Diverg...
Tijmen Tieleman
CVPR
2000
IEEE
15 years 11 months ago
Learning in Gibbsian Fields: How Accurate and How Fast Can It Be?
?Gibbsian fields or Markov random fields are widely used in Bayesian image analysis, but learning Gibbs models is computationally expensive. The computational complexity is pronoun...
Song Chun Zhu, Xiuwen Liu
EDBT
2011
ACM
281views Database» more  EDBT 2011»
14 years 1 months ago
Fast and accurate computation of equi-depth histograms over data streams
Equi-depth histograms represent a fundamental synopsis widely used in both database and data stream applications, as they provide the cornerstone of many techniques such as query ...
Hamid Mousavi, Carlo Zaniolo
CORR
2012
Springer
230views Education» more  CORR 2012»
13 years 5 months ago
Fast Triangle Counting through Wedge Sampling
Graphs and networks are used to model interactions in a variety of contexts, and there is a growing need to be able to quickly assess the qualities of a graph in order to understa...
C. Seshadhri, Ali Pinar, Tamara G. Kolda