Sciweavers

170 search results - page 5 / 34
» On computational properties of chains of recurrences
Sort
View
ISPASS
2003
IEEE
14 years 18 days ago
Accelerating private-key cryptography via multithreading on symmetric multiprocessors
Achieving high performance in cryptographic processing is important due to the increasing connectivity among today’s computers. Despite steady improvements in microprocessor and...
Praveen Dongara, T. N. Vijaykumar
COR
2006
94views more  COR 2006»
13 years 7 months ago
Computing obnoxious 1-corner polygonal chains
We consider an obnoxious facility location problem in which the facility is a trajectory consisting of a bounded length polygonal chain of two edges having extremes anchored at tw...
José Miguel Díaz-Báñez...
TNN
2008
138views more  TNN 2008»
13 years 7 months ago
A Fast and Scalable Recurrent Neural Network Based on Stochastic Meta Descent
This brief presents an efficient and scalable online learning algorithm for recurrent neural networks (RNNs). The approach is based on the real-time recurrent learning (RTRL) algor...
Zhenzhen Liu, Itamar Elhanany
NEUROSCIENCE
2001
Springer
13 years 11 months ago
Recurrent Long-Range Interactions in Early Vision
Abstract. A general principle of cortical architecture is the bidirectional flow of information along feedforward and feedback connections. In the feedforward path, converging con...
Thorsten Hansen, Wolfgang Sepp, Heiko Neumann
TCC
2007
Springer
170views Cryptology» more  TCC 2007»
14 years 1 months ago
Secure Linear Algebra Using Linearly Recurrent Sequences
In this work we present secure two-party protocols for various core problems in linear algebra. Our main result is a protocol to obliviously decide singularity of an encrypted matr...
Eike Kiltz, Payman Mohassel, Enav Weinreb, Matthew...