Sciweavers

32 search results - page 3 / 7
» Random testing of C calling conventions
Sort
View
ICASSP
2011
IEEE
12 years 11 months ago
Automatic speech recognition using Hidden Conditional Neural Fields
Hidden Conditional Random Fields(HCRF) is a very promising approach to model speech. However, because HCRF computes the score of a hypothesis by summing up linearly weighted featu...
Yasuhisa Fujii, Kazumasa Yamamoto, Seiichi Nakagaw...
STOC
2009
ACM
99views Algorithms» more  STOC 2009»
14 years 8 months ago
Testing juntas nearly optimally
A function on n variables is called a k-junta if it depends on at most k of its variables. In this article, we show that it is possible to test whether a function is a k-junta or ...
Eric Blais
DAC
2006
ACM
14 years 8 months ago
Scheduling-based test-case generation for verification of multimedia SoCs
Multimedia SoCs are characterized by a main controller that directs the activity of several cores, each of which is in charge of a stage in the processing of a media stream. The v...
Amir Nahir, Avi Ziv, Roy Emek, Tal Keidar, Nir Ron...
PKC
2007
Springer
125views Cryptology» more  PKC 2007»
14 years 1 months ago
Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol
Damg˚ard et al. [11] showed a novel technique to convert a polynomial sharing of secret a into the sharings of the bits of a in constant rounds, which is called the bit-decomposit...
Takashi Nishide, Kazuo Ohta
PPOPP
2009
ACM
14 years 7 months ago
Serialization sets: a dynamic dependence-based parallel execution model
This paper proposes a new parallel execution model where programmers augment a sequential program with pieces of code called serializers that dynamically map computational operati...
Matthew D. Allen, Srinath Sridharan, Gurindar S. S...