Sciweavers

1461 search results - page 31 / 293
» On Regular Reduced Products
Sort
View
JCP
2007
94views more  JCP 2007»
13 years 8 months ago
Low-Complexity Analysis of Repetitive Regularities for Biometric Applications
— Presented in this paper is a joint algorithm optimization and architecture design framework for analysis of repetitive regularities. Two closely coupled algorithm optimization ...
Lei Wang, Niral Patel
PRL
2011
13 years 3 months ago
Efficient approximate Regularized Least Squares by Toeplitz matrix
Machine Learning based on the Regularized Least Square (RLS) model requires one to solve a system of linear equations. Direct-solution methods exhibit predictable complexity and s...
Sergio Decherchi, Paolo Gastaldo, Rodolfo Zunino
CRYPTO
2000
Springer
157views Cryptology» more  CRYPTO 2000»
14 years 1 months ago
Reducing the Servers Computation in Private Information Retrieval: PIR with Preprocessing
Private information retrieval (PIR) enables a user to retrieve a data item from a database, replicated among one or more servers, while hiding the identity of the retrieved item. ...
Amos Beimel, Yuval Ishai, Tal Malkin
ISMVL
2010
IEEE
161views Hardware» more  ISMVL 2010»
13 years 10 months ago
Revisiting Ultraproducts in Fuzzy Predicate Logics
—In this paper we examine different possibilities of defining reduced products and ultraproducts in fuzzy predicate logics. We present analogues to the Łos Theorem for these no...
Pilar Dellunde
ISBI
2007
IEEE
14 years 3 months ago
Space-Time Sparsity Regularization for the Magnetoencephalography Inverse Problem
The concept of “Space-Time Sparsity” (STS) penalization is introduced for solving the magnetoencephalography (MEG) inverse problem. The STS approach assumes that events of int...
Andrew K. Bolstad, Barry D. Van Veen, Robert D. No...