Sciweavers

347 search results - page 41 / 70
» The Berlekamp-Massey Algorithm revisited
Sort
View
ECCV
2006
Springer
15 years 2 months ago
Trace Quotient Problems Revisited
The formulation of trace quotient is shared by many computer vision problems; however, it was conventionally approximated by an essentially different formulation of quotient trace,...
Shuicheng Yan, Xiaoou Tang
CRYPTO
2010
Springer
157views Cryptology» more  CRYPTO 2010»
15 years 1 days ago
Oblivious RAM Revisited
We reinvestigate the oblivious RAM concept introduced by Goldreich and Ostrovsky, which enables a client, that can store locally only a constant amount of data, to store remotely ...
Benny Pinkas, Tzachy Reinman
CORR
2007
Springer
115views Education» more  CORR 2007»
14 years 11 months ago
Q-adic Transform revisited
We present an algorithm to perform a simultaneous modular reduction of several residues. This enables to compress polynomials into integers and perform several modular operations ...
Jean-Guillaume Dumas
TPLP
2008
89views more  TPLP 2008»
14 years 10 months ago
Theory of finite or infinite trees revisited
We present in this paper a first-order axiomatization of an extended theory T of finite or infinite trees, built on a signature containing an infinite set of function symbols and ...
Khalil Djelloul, Thi-Bich-Hanh Dao, Thom W. Fr&uum...
CEC
2010
IEEE
15 years 1 days ago
Beyond No Free Lunch: Realistic algorithms for arbitrary problem classes
In this paper we present a simple and general new No Free Lunch-like result that applies to revisiting algorithms searching arbitrary problem sets. We begin by unifying the assumpt...
James A. R. Marshall, Thomas G. Hinton