Sciweavers

35 search results - page 4 / 7
» The Chebyshev iteration revisited
Sort
View
SODA
2012
ACM
209views Algorithms» more  SODA 2012»
11 years 8 months ago
Simple and practical algorithm for sparse Fourier transform
We consider the sparse Fourier transform problem: given a complex vector x of length n, and a parameter k, estimate the k largest (in magnitude) coefficients of the Fourier transf...
Haitham Hassanieh, Piotr Indyk, Dina Katabi, Eric ...
SACRYPT
2001
Springer
110views Cryptology» more  SACRYPT 2001»
13 years 10 months ago
Random Walks Revisited: Extensions of Pollard's Rho Algorithm for Computing Multiple Discrete Logarithms
This paper extends the analysis of Pollard’s rho algorithm for solving a single instance of the discrete logarithm problem in a finite cyclic group G to the case of solving more...
Fabian Kuhn, René Struik
CG
2000
Springer
13 years 6 months ago
Chaotic attractors with cyclic symmetry revisited
Chaotic attractors generated by the iteration of polynomial functions with cyclic symmetry have been the subject of recent study. A new formulation is investigated which generates ...
Kevin C. Jones, Clifford A. Reiter
CHI
2005
ACM
14 years 6 months ago
The advantages of a cross-session web workspace
Conducting research using the web is often an iterative process of collecting, comparing and contrasting information. Not surprisingly, web-based research tasks habitually span mu...
Kari-Jouko Räihä, Natalie Jhaveri
CVPR
2006
IEEE
14 years 8 months ago
The Registration Problem Revisited: Optimal Solutions From Points, Lines and Planes
In this paper we propose a practical and efficient method for finding the globally optimal solution to the problem of pose estimation of a known object. We present a framework tha...
Carl Olsson, Fredrik Kahl, Magnus Oskarsson