نتایج جستجو برای: dispersivity parameter
تعداد نتایج: 215104 فیلتر نتایج به سال:
In this paper we propose a method for implementing a high-level interface for the synthesis and animation of animated virtual faces that is in full compliance with MPEG-4 specifications. This method allows us to implement the Simple Facial Object profile and part of the Calibration Facial Object Profile. In fact, starting from a facial wire-frame and from a set of configuration files, the devel...
A g-element for a graded R-module is a one-form with properties similar to a Lefschetz class in the cohomology ring of a compact complex projective manifold, except that the induced multiplication maps are injections instead of bijections. We show that if k(∆) is the face ring of the independence complex of a matroid and the characteristic of k is zero, then there is a non-empty Zariski open su...
Using the “glueball dominance” picture of the mixing between qq̄ mesons of different hidden flavors, we establish new glueball-meson mass relations which serve as a basis for glueball spectral systematics. For the tensor glueball mass 2.3 ± 0.1 GeV used as an input parameter, these relations predict the following glueball masses: M(0) ≃ 1.65 ± 0.05 GeV, M(1) ≃ 3.2 ± 0.2 GeV, M(2) ≃ 2.95 ± 0.15 G...
This paper presents an automatic FDP (Facial Definition Parameters) and FAP (Facial Animation Parameters) generation method from an image sequence that captures a frontal face. The proposed method is based on facial feature tracking without markers on a face. We present an efficient method to extract 2D facial features and to generate the FDP by applying 2D features to a generic face model. We ...
A secret sharing scheme permits a secret to be shared among participants in such a way that only qualiied subsets of participants can recover the secret. If any non qualiied subset has absolutely no information about the secret, then the scheme is called perfect. Unfortunately, in this case the size of the shares cannot be less than the size of the secret. Krawczyk 9] showed how to improve this...
LUCIA, a new Italian talking head based on a modified version of the Cohen-Massaro’s labial coarticulation model is described. A semi-automatic minimization technique, working on real cinematic data, acquired by the ELITE optoelectronic system, was used to train the dynamic characteristics of the model. LUCIA is an MPEG-4 standard facial animation system working on standard FAP visual parameter...
We present the first fair e-cash system with a compact wallet that enables users to spend efficiently k coins while only sending to the merchant O(λ log k) bits, where λ is a security parameter. The best previously known schemes require to transmit data of size at least linear in the number of spent coins. This result is achieved thanks to a new way to use the Batch RSA technique and a tree-bas...
We consider the problem of estimating the length of a shortest path in a DAG whose edge lengths are known only approximately but can be determined exactly at a cost. Initially, each edge e is known only to lie within an interval [le; he]; the estimation algorithm can pay ce to nd the exact length of e. In particular, we study the problem of nding the cheapest set of edges such that, if exactly ...
At Crypto 2013, Coron, Lepoint, and Tibouchi (CLT) proposed a practical Graded Encoding Scheme (GES) over the integers, which has very similar cryptographic features to ideal multilinear maps. In fact, the scheme of Coron et al. is the second proposal of a secure GES, and has advantages over the first scheme of Garg, Gentry, and Halevi (GGH). For example, unlike the GGH construction, the subgro...
We construct the first constant-size hierarchical identity-based signature (HIBS) without random oracles the signature size is O(λs) bits, where λs is the security parameter, and it is independent of the number of levels in the hierarchy. We observe that an efficient hierarchical identity-based signcryption (HIBSC) scheme without random oracles can be compositioned from our HIBS and Boneh, Boye...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید