Results 1  10
of
79
Manuscrit auteur, publié dans "7è Journées Nationales de la Recherche en Robotique, JNRR'09., NeuvysurBarangeon: France (2009)"
, 2009
"... micrométriques: les challenges pour leur manipulation et leur assemblage ..."
Supported by
, 1977
"... "Approved for public release; distribution unlimited". "The findings in this report are not to be construed as an official Department of the Army position unless so designated by other authorized documents". fftT«Jnrr.i * CNKAI1HD A , J^JX WOT « ««•«•«•• ItOBunT.mnTiT. ..."
Abstract
 Add to MetaCart
"Approved for public release; distribution unlimited". "The findings in this report are not to be construed as an official Department of the Army position unless so designated by other authorized documents". fftT«Jnrr.i * CNKAI1HD A , J^JX WOT « ««•«•«•• ItOBunT.mnTiT.
Efficient and certified algorithms for solving polynomial system of equalities and inequalities
, 2005
"... This paper is of mostly of expository nature and has to be considered as a support for the author’s lecture at JNRR’05. We mainly describe some efficient strategies for studying real roots of zero dimensional systems (with a finite number of complex roots) as well as parametric systems, with or wi ..."
Abstract
 Add to MetaCart
This paper is of mostly of expository nature and has to be considered as a support for the author’s lecture at JNRR’05. We mainly describe some efficient strategies for studying real roots of zero dimensional systems (with a finite number of complex roots) as well as parametric sys
Computing faces in segment and simplex arrangements
 In Proc. 27th Annu. ACM Sympos. Theory Comput
, 1995
"... For a set S of n line segments in the plane, we give the first workoptimal deterministic parallel algorithm for constructing their arrangement. It runs in O(log 2 n) time using O(n log n + k) work in the EREW PRAM model, where k is the number of intersecting line segment pairs, and provides a fairl ..."
Abstract

Cited by 16 (10 self)
 Add to MetaCart
For a set S of n line segments in the plane, we give the first workoptimal deterministic parallel algorithm for constructing their arrangement. It runs in O(log 2 n) time using O(n log n + k) work in the EREW PRAM model, where k is the number of intersecting line segment pairs, and provides a fairly simple divideandconquer alternative to the optimal sequential “planesweep ” algorithm of Chazelle and Edelsbrunner. Moreover, our method can be used to output all k intersecting pairs while using only O(n) working space, which solves an open problem posed by Chazelle and Edelsbrunner. We also describe a sequential algorithm for computing a single face in an arrangement of n line segments that runs in O(n 2 (n) log n) time, which improves on a previous O(n log 2 n) time algorithm. For collections of simplices in IR d, we give methods for constructing a set of m = O(n d,1 log c n+k) cells of constant descriptive complexity that covers their arrangement, where c> 1 is a constant and k is the number of faces in the arrangement. The construction is performed sequentially in O(m) time, or in O(log n) time using O(m) work in the EREW PRAM model. The covering can be augmented to answer point location queries in O(log n) time. In addition to supplying the first parallel methods for these problems, we improve on the previous best sequential methods by reducing the query times (from O(log 2 n) in IR 3 and O(log 3 n) in IR d, d>3), and also the size and construction cost of the covering (from O(n d,1+ + k)). 1
NearOptimal Load Balancing in Dense Wireless MultiHop Networks
 NGI 2008, 4TH CONFERENCE ON NEXT GENERATION INTERNET NETWORKS
, 2008
"... Abstract—We consider the load balancing problem in wireless multihop networks. In the limit of a dense network, there is a strong separation between the macroscopic and microscopic scales, and the load balancing problem can be formulated as finding continuous curves (“routes”) between all sourcede ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
destination pairs that minimize the maximum of the socalled scalar packet flux (“traffic load”). In this paper we reformulate the problem by focusing entirely on the socalled dflows (vector flow field of packets with a common destination x) and by looking at the equation these flows have to satisfy. The general
Equivalence of variational problems of higher order
 Differential Geometry and its Applications , Volume 29, Issue 2
, 2011
"... ar ..."
Encompassing Heterogeneity Autonomous Robot “Software ” are intrinsically
"... synthèse de contrôleur pour robots autonomes ..."
Rolebased access control for a distributed calculus
 Journal of Computer Security
, 2006
"... Rôlebased access control (RBAC) is increasingly attracting attention because it reduces the complexity and cost of security administration by interposing the notion of rôle in the assignment of permissions to users. In this paper, we present a formal framework relying on an extension of the πcalcu ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
Rôlebased access control (RBAC) is increasingly attracting attention because it reduces the complexity and cost of security administration by interposing the notion of rôle in the assignment of permissions to users. In this paper, we present a formal framework relying on an extension of the πcalculus to study the behaviour of concurrent systems in a RBAC scenario. We define a type system ensuring that the specified policy is respected during computations, and a behavioural equivalence to equate systems. We then consider a more sophisticated feature that can be easily integrated in our framework, i.e., the possibility of automatically adding rôle activations and deactivations to processes to be run under a given policy (whenever possible). Finally, we show how the framework can be easily extended to express significant extensions of the core RBAC model, such as rôles hierarchies or constraints determining the acceptability of the system components.
From step edge to line edge: Combining geometric and photometric information
 In MVA '94 IAPR Workshop on Machine Vision Applications
, 1994
"... As a Gradient rlctector produces two extrema when applird t,o a line, we propose an original method which is bawd on sr~cll a detector but which appropriately rcsponds to both step and line eclges. The ma.in idras are first to ident,ify line contours using geometric and phot,omctric propcrt,ics and ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
As a Gradient rlctector produces two extrema when applird t,o a line, we propose an original method which is bawd on sr~cll a detector but which appropriately rcsponds to both step and line eclges. The ma.in idras are first to ident,ify line contours using geometric and phot,omctric propcrt,ics and second to s~tbstitute a line for a single cont.oi~r using a simple geometric algorithm. 1.
8ème Atelier sur la Fouille de Données Complexes Complexité liée aux données multiples
"... Résumé. L’atelier sur la fouille de données complexes est proposé à l’instigation du groupe de travail EGC "Fouille de données complexes". Chaque année les organisateurs proposent une thématique de recherche qui suscite l’intérêt des chercheurs et des industriels. La précédente édition de ..."
Abstract
 Add to MetaCart
de l’atelier ayant permis de fédérer avec succès des recherches portant sur la problématique de complexité liée à la multiplicité des données, nous avons choisit de renouveler l’affichage de cette priorité thématique pour cette huitième édition. 1 Le groupe de travail “Fouille de Données Complexes
Results 1  10
of
79