Sciweavers

141 search results - page 12 / 29
» Fast probabilistic snake algorithm
Sort
View
FOCS
2000
IEEE
15 years 10 months ago
Computing the Determinant and Smith Form of an Integer Matrix
A probabilistic algorithm is presented to find the determinant of a nonsingular, integer matrix. For a matrix A ¡£¢ n¤ n the algorithm requires O¥ n3¦5 ¥ logn§ 4¦5§ bit...
Wayne Eberly, Mark Giesbrecht, Gilles Villard
SAC
2006
ACM
15 years 11 months ago
A probability analysis for candidate-based frequent itemset algorithms
This paper explores the generation of candidates, which is an important step in frequent itemset mining algorithms, from a theoretical point of view. Important notions in our prob...
Nele Dexters, Paul W. Purdom, Dirk Van Gucht
SP
2009
IEEE
16 years 17 days ago
Exploiting Unix File-System Races via Algorithmic Complexity Attacks
We defeat two proposed Unix file-system race condition defense mechanisms. First, we attack the probabilistic defense mechanism of Tsafrir, et al., published at USENIX FAST 2008[...
Xiang Cai, Yuwei Gui, Rob Johnson
ACCV
2006
Springer
15 years 11 months ago
Probabilistic Modeling for Structural Change Inference
We view the task of change detection as a problem of object recognition from learning. The object is defined in a 3D space where the time is the 3rd dimension. We propose two com...
Wei Liu, Véronique Prinet
CRYPTO
2001
Springer
147views Cryptology» more  CRYPTO 2001»
15 years 10 months ago
Correlation Analysis of the Shrinking Generator
Abstract. The shrinking generator is a well-known keystream generator composed of two linear feedback shift registers, LFSR1 and LFSR2, where LFSR1 is clock-controlled according to...
Jovan Dj. Golic