Sciweavers

539 search results - page 20 / 108
» Recurrence relations and fast algorithms
Sort
View
CHES
2005
Springer
83views Cryptology» more  CHES 2005»
15 years 11 months ago
Fast Truncated Multiplication for Cryptographic Applications
The Truncated Multiplication computes a truncated product, a contiguous subsequence of the digits of the product of 2 integers. A few truncated polynomial multiplication algorithms...
Laszlo Hars
ESOP
2008
Springer
15 years 7 months ago
Upper Adjoints for Fast Inter-procedural Variable Equalities
We present a polynomial-time algorithm which at the extra cost of a factor O(k) (k the number of variables) generalizes inter-procedural copy constant propagation. Our algorithm in...
Markus Müller-Olm, Helmut Seidl
PAMI
2010
164views more  PAMI 2010»
15 years 4 months ago
Large-Scale Discovery of Spatially Related Images
— We propose a randomized data mining method that finds clusters of spatially overlapping images. The core of the method relies on the min-Hash algorithm for fast detection of p...
Ondrej Chum, Jiri Matas
TACAS
2005
Springer
98views Algorithms» more  TACAS 2005»
15 years 11 months ago
Monte Carlo Model Checking
We present MC2 , what we believe to be the first randomized, Monte Carlo algorithm for temporal-logic model checking, the classical problem of deciding whether or not a property s...
Radu Grosu, Scott A. Smolka
CVPR
2005
IEEE
16 years 8 months ago
Fast Spatial Pattern Discovery Integrating Boosting with Constellations of Contextual Descriptors
We present a novel approach for fast object class recognition incorporating contextual information into boosting. The object is represented as a constellation of generalized corre...
Jaume Amores, Nicu Sebe, Petia Radeva