Sciweavers

6202 search results - page 264 / 1241
» Without Loss of Generality
Sort
View
CHES
2004
Springer
128views Cryptology» more  CHES 2004»
16 years 2 days ago
Long Modular Multiplication for Cryptographic Applications
Abstract. A digit-serial, multiplier-accumulator based cryptographic coprocessor architecture is proposed, similar to fix-point DSP's with enhancements, supporting long modula...
Laszlo Hars
ICML
2010
IEEE
15 years 7 months ago
A Fast Augmented Lagrangian Algorithm for Learning Low-Rank Matrices
We propose a general and efficient algorithm for learning low-rank matrices. The proposed algorithm converges super-linearly and can keep the matrix to be learned in a compact fac...
Ryota Tomioka, Taiji Suzuki, Masashi Sugiyama, His...
ENTCS
2002
121views more  ENTCS 2002»
15 years 6 months ago
Modal Predicates and Co-equations
We show how coalgebras can be presented by operations and equations. This is a special case of Linton's approach to algebras over a general base category X, namely where X is...
Alexander Kurz, Jirí Rosický
MOC
2002
70views more  MOC 2002»
15 years 6 months ago
Positivity preserving finite element approximation
We consider finite element operators defined on "rough" functions in a bounded polyhedron in RN . Insisting on preserving positivity in the approximations, we discover a...
Ricardo H. Nochetto, Lars B. Wahlbin
ICCD
1997
IEEE
78views Hardware» more  ICCD 1997»
15 years 11 months ago
Speeding up Variable Reordering of OBDDs
In this paper, we suggest a block-restricted sifting strategy which is based on the restriction of Rudell's sifting to certain blocks of variables. The application of this st...
Christoph Meinel, Anna Slobodová