Institution
French Institute for Research in Computer Science and Automation
Government•Le Chesnay, France•
About: French Institute for Research in Computer Science and Automation is a government organization based out in Le Chesnay, France. It is known for research contribution in the topics: Context (language use) & Population. The organization has 13012 authors who have published 38653 publications receiving 1318995 citations. The organization is also known as: INRIA & Institute for national research in information science and automatic control.
Papers published on a yearly basis
Papers
More filters
••
04 May 1997
TL;DR: A novel approach to access rights management for such an architecture is detailed, based on a new kind of access rights and a new scheme of privilege delegation, which addresses the problem of distributed object system protection.
Abstract: Addresses the problem of distributed object system protection. A new authorization scheme is presented and described, based on the collaboration between a central authorization server and security kernels located on each site of the system. A novel approach to access rights management for such an architecture is detailed, based on a new kind of access rights and a new scheme of privilege delegation. This authorization scheme can be adapted to various security policies, including multilevel policies such as that of Bell & LaPadula (1975). An extension of the Bell-LaPadula model to distributed object systems is presented and its implementation using the authorization scheme is described.
30 citations
••
TL;DR: A statistical scheme based on a subspace method is described for detecting and tracking faces under varying poses for videophone sequences and the amplitude projections around the speaker's mouth are analyzed to describe the shape of the lips.
30 citations
••
04 Jan 2011TL;DR: This work detail the extension of the multiscale anisotropic mesh adaptation, i.e., a control of the interpolation error in L norm, to unsteady flows thanks to an enhanced version of the fixed-point algorithm.
Abstract: This paper deals with anisotropic mesh adaptation applied to unsteady simulations, especially those involving moving geometries. Anisotropic metric-based mesh adaptation is an efficient strategy to reduce the extensive CPU time currently required by such simulations in the perspective of performing this kind of computations on a daily basis in an industrial context. In this work, we detail the extension of the multiscale anisotropic mesh adaptation, i.e., a control of the interpolation error in L norm, to unsteady flows thanks to an enhanced version of the fixed-point algorithm. The parallelization of the whole mesh adaptation plate-form is also discussed. The efficiency of the approach is emphasized on three-dimensional blast problems. The last part of this paper is concerned with the extension of this new algorithm to moving mesh problems. We explain how the mesh displacement is taken into account in the adaptation strategy. The method is illustrated on three-dimensional analytical examples and on a two dimensional blast computation.
30 citations
••
TL;DR: The adopted methodology in providing end-to-end QoS is through an integrated management in the context of MPEG-21 framework for managing services at both customer and provider levels using Service Level Agreements (SLA) concept and provisioning network resources for satisfying the customer QoS demands.
30 citations
••
12 Dec 2007TL;DR: It is shown that whenever a protocol is secure, it remains secure even in an environment where arbitrary protocols are executed, provided each encryption contains some tag identifying each protocol, like e.g. the name of the protocol.
Abstract: Security protocols are small programs that are executed in hostile environments. Many results and tools have been developed to formally analyze the security of a protocol. However even when a protocol has been proved secure, there is absolutely no guarantee if the protocol is executed in an environment where other protocols, possibly sharing some common identities and keys like public keys or long-term symmetric keys, are executed.
In this paper, we show that whenever a protocol is secure, it remains secure even in an environment where arbitrary protocols are executed, provided each encryption contains some tag identifying each protocol, like e.g. the name of the protocol.
30 citations
Authors
Showing all 13078 results
Name | H-index | Papers | Citations |
---|---|---|---|
Cordelia Schmid | 135 | 464 | 103925 |
Bernt Schiele | 130 | 568 | 70032 |
Francis Bach | 110 | 484 | 54944 |
Jian Sun | 109 | 360 | 239387 |
Pascal Fua | 102 | 614 | 49751 |
Nicholas Ayache | 97 | 624 | 43140 |
Olivier Bernard | 96 | 790 | 37878 |
Laurent D. Cohen | 94 | 417 | 42709 |
Peter Sturm | 93 | 548 | 39119 |
Guy Orban | 93 | 455 | 26178 |
Sebastien Ourselin | 91 | 1116 | 34683 |
François Fleuret | 91 | 936 | 42585 |
Katrin Amunts | 89 | 438 | 35069 |
Tamer Basar | 88 | 977 | 34903 |
Nassir Navab | 88 | 1375 | 41537 |