Sciweavers

2745 search results - page 265 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
159
Voted
TCS
2008
15 years 4 months ago
Generalized approximate counting revisited
A large class of q-distributions is defined on the stochastic model of Bernoulli trials in which the probability of success (=advancing to the next level) depends geometrically on...
Guy Louchard, Helmut Prodinger
ISW
2007
Springer
15 years 11 months ago
New Weaknesses in the Keystream Generation Algorithms of the Stream Ciphers TPy and Py
The stream ciphers Py, Py6 designed by Biham and Seberry were promising candidates in the ECRYPT-eSTREAM project because of their impressive speed. Since their publication in Apri...
Gautham Sekar, Souradyuti Paul, Bart Preneel
ECCV
2006
Springer
16 years 6 months ago
Balanced Exploration and Exploitation Model Search for Efficient Epipolar Geometry Estimation
Abstract. The estimation of the epipolar geometry is especially difficult where the putative correspondences include a low percentage of inlier correspondences and/or a large subse...
Liran Goshen, Ilan Shimshoni
ICCV
2009
IEEE
1022views Computer Vision» more  ICCV 2009»
16 years 9 months ago
Kernelized Locality-Sensitive Hashing for Scalable Image Search
Fast retrieval methods are critical for large-scale and data-driven vision applications. Recent work has explored ways to embed high-dimensional features or complex distance fun...
Brian Kulis, Kristen Grauman
ACCV
2010
Springer
14 years 12 months ago
Human Pose Estimation Using Exemplars and Part Based Refinement
In this paper, we proposed a fast and accurate human pose estimation framework that combines top-down and bottom-up methods. The framework consists of an initialization stage and a...
Yanchao Su, Haizhou Ai, Takayoshi Yamashita, Shiho...