Sciweavers

1818 search results - page 228 / 364
» Granularity-Adaptive Proof Presentation
Sort
View
JMLR
2010
195views more  JMLR 2010»
15 years 2 months ago
Online Learning for Matrix Factorization and Sparse Coding
Sparse coding—that is, modelling data vectors as sparse linear combinations of basis elements—is widely used in machine learning, neuroscience, signal processing, and statisti...
Julien Mairal, Francis Bach, Jean Ponce, Guillermo...
MP
2010
94views more  MP 2010»
15 years 2 months ago
MIR closures of polyhedral sets
We study the mixed-integer rounding (MIR) closures of polyhedral sets. The MIR closure of a polyhedral set is equal to its split closure and the associated separation problem is N...
Sanjeeb Dash, Oktay Günlük, Andrea Lodi
PAIRING
2010
Springer
153views Cryptology» more  PAIRING 2010»
15 years 2 months ago
Compact Hardware for Computing the Tate Pairing over 128-Bit-Security Supersingular Curves
This paper presents a novel method for designing compact yet efficient hardware implementations of the Tate pairing over supersingular curves in small characteristic. Since such cu...
Nicolas Estibals
97
Voted
TASLP
2010
84views more  TASLP 2010»
15 years 2 months ago
Wideband and Isotropic Room Acoustics Simulation Using 2-D Interpolated FDTD Schemes
—In this paper, a complete method for finite-difference time-domain modeling of rooms in 2-D using compact explicit schemes is presented. A family of interpolated schemes using ...
Konrad Kowalczyk, Maarten van Walstijn
AGP
2010
IEEE
15 years 2 months ago
Concurrent and Reactive Constraint Programming
The Italian Logic Programming community has given several contributions to the theory of Concurrent Constraint Programming. In particular, in the topics of semantics, verification,...
Maurizio Gabbrielli, Catuscia Palamidessi, Frank D...