Sciweavers

1439 search results - page 44 / 288
» Fast approximation of centrality
Sort
View
COMPUTING
2002
80views more  COMPUTING 2002»
13 years 10 months ago
A Method for Approximate Inversion of the Hyperbolic CDF
It has been observed by E. Eberlein and U. Keller that the hyperbolic distribution fits logarithmic rates of returns of a stock much better than the normal distribution. We give a...
Gunther Leobacher, Friedrich Pillichshammer
ICRA
2010
IEEE
120views Robotics» more  ICRA 2010»
13 years 9 months ago
Approximation of feasibility tests for reactive walk on HRP-2
— We present here an original approach to test the feasibility of footsteps for a given walking pattern generator. It is based on a new approximation algorithm intended to cope w...
Nicolas Perrin, Olivier Stasse, Florent Lamiraux, ...
TCSV
2008
131views more  TCSV 2008»
13 years 11 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
14 years 11 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
DEXAW
2003
IEEE
158views Database» more  DEXAW 2003»
14 years 4 months ago
Temporal Information Retrieval in Cooperative Search Engine
In business, the retrieval of up-to-date, or fresh, information is very important. It is difficult for conventional search engines based on a centralized architecture to retrieve ...
Nobuyoshi Sato, Minoru Uehara, Yoshifumi Sakai