2949 search results - page 56 / 590 » Universal Sparse Modeling |
114
Voted
INTERSPEECH
2010
14 years 7 months ago
2010
This paper describes Brno University of Technology (BUT) system for the Interspeech 2010 Paralinguistic Challenge. Our submitted systems for the Age- and Gender-Sub-Challenges emp...
IPPS
1999
IEEE
15 years 4 months ago
1999
IEEE
The Paderborn University BSP (PUB) library is a parallel C library based on the BSP model. The basic library supports buffered and unbuffered asynchronous communication between an...
108
click to vote
CTRSA
2006
Springer
15 years 4 months ago
2006
Springer
We construct efficient universally composable oblivious transfer protocols in the multi-party setting for honest majorities. Unlike previous proposals our protocols are designed in...
125
Voted
CAV
2006
Springer
15 years 4 months ago
2006
Springer
We propose and evaluate a new algorithm for checking the universality of nondeterministic finite automata. In contrast to the standard algorithm, which uses the subset construction...
118
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
The estimation of a sparse vector in the linear model is a fundamental problem in signal processing, statistics, and compressive sensing. This paper establishes a lower bound on t...