Sciweavers

898 search results - page 63 / 180
» A Linear Tabling Mechanism
Sort
View
ASIACRYPT
2008
Springer
14 years 11 months ago
Speeding Up the Pollard Rho Method on Prime Fields
Abstract. We propose a method to speed up the r-adding walk on multiplicative subgroups of the prime field. The r-adding walk is an iterating function used with the Pollard rho alg...
Jung Hee Cheon, Jin Hong, Minkyu Kim
ICISC
2001
132views Cryptology» more  ICISC 2001»
14 years 11 months ago
Slide Attacks with a Known-Plaintext Cryptanalysis
Although many strong cryptanalytic tools exploit weaknesses in the data-randomizinig part of a block cipher, relatively few general tools for cryptanalyzing on the other part, the ...
Soichi Furuya
UAI
2004
14 years 11 months ago
Mixtures of Deterministic-Probabilistic Networks and their AND/OR Search Space
The paper introduces mixed networks, a new framework for expressing and reasoning with probabilistic and deterministic information. The framework combines belief networks with con...
Rina Dechter, Robert Mateescu
DISOPT
2008
78views more  DISOPT 2008»
14 years 10 months ago
N-fold integer programming
In this article we study a broad class of integer programming problems in variable dimension. We show that these so-termed n-fold integer programming problems are polynomial time ...
Jesús A. De Loera, Raymond Hemmecke, Shmuel...
CSDA
2006
85views more  CSDA 2006»
14 years 9 months ago
Fast and compact smoothing on large multidimensional grids
A framework of penalized generalized linear models and tensor products of B-splines with roughness penalties allows effective smoothing of data in multidimensional arrays. A strai...
Paul H. C. Eilers, Iain D. Currie, María Du...