190 search results - page 5 / 38 » A Simple Proof Technique for Certain Parametricity Results |
77
Voted
DM
2008
14 years 11 months ago
2008
A recent proof that the Grassmannian G1;n;2 of lines of PG(n; 2) has polynomial degree n 2 1 is outlined, and is shown to yield a theorem about certain kinds of subgraphs of any (...
81
Voted
SPEECH
2010
14 years 9 months ago
2010
We have applied two state-of-the-art speech synthesis techniques (unit selection and HMM-based synthesis) to the synthesis of emotional speech. A series of carefully designed perc...
86
Voted
CORR
2006
Springer
14 years 11 months ago
2006
Springer
We present in this paper a library to compute with Taylor models, a technique extending interval arithmetic to reduce decorrelation and to solve differential equations. Numerical s...
GI
2004
Springer
15 years 4 months ago
2004
Springer
Abstract: Optimizations in compilers are the most error-prone phases in the compilation process. Since correct compilers are a vital precondition for software correctness, it is ne...
111
click to vote
CCS
2010
ACM
14 years 11 months ago
2010
ACM
We provide new constructions of Leakage-Resilient IdentityBased Encryption systems (IBE) in the Standard model. We apply a hash proof technique in the existing IBE schemes of Bone...