2413 search results - page 46 / 483 » Models for universal usability |
INTERSPEECH
2010
13 years 4 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
14 years 2 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...
CTRSA
2006
Springer
14 years 1 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...
ICASSP
2011
IEEE
13 years 1 months ago
2011
IEEE
The recent upsurge of research toward compressive sampling and parsimonious signal representations hinges on signals being sparse, either naturally, or, after projecting them on a...
CAV
2006
Springer
14 years 1 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...