Zobrazeno 1 - 10
of 45
pro vyhledávání: '"Stéphane Ubéda"'
Publikováno v:
International Journal of Distributed Sensor Networks, Vol 9 (2013)
Wireless sensor networks (WSNs) are composed of numerous low-cost, low-power sensor nodes communicating at short distance through wireless links. Sensors are densely deployed to collect and transmit data of the physical world to one or few destinatio
Externí odkaz:
https://doaj.org/article/795dada9f286446ca944ee153240aab9
Publikováno v:
Revue des Sciences et Technologies de l'Information-Série TSI : Technique et Science Informatiques
Revue des Sciences et Technologies de l'Information-Série TSI : Technique et Science Informatiques, 2005, 24 (1), pp.39-64. ⟨10.3166/tsi.24.39-64⟩
Revue des Sciences et Technologies de l'Information-Série TSI : Technique et Science Informatiques, Lavoisier, 2005, 24 (1), pp.39-64. ⟨10.3166/tsi.24.39-64⟩
Revue des Sciences et Technologies de l'Information-Série TSI : Technique et Science Informatiques, 2005, 24 (1), pp.39-64. ⟨10.3166/tsi.24.39-64⟩
Revue des Sciences et Technologies de l'Information-Série TSI : Technique et Science Informatiques, Lavoisier, 2005, 24 (1), pp.39-64. ⟨10.3166/tsi.24.39-64⟩
National audience; Cet article présente un état de l art des architectures basées sur IP supportant les environnements hétérogènes réunissant un réseau ad hoc et un réseau d accès fixe combinant liens filaires et liens sans fil. Nous avons
Publikováno v:
Electronic Notes in Theoretical Computer Science
Electronic Notes in Theoretical Computer Science, Elsevier, 2001, 46, pp.177-187
Electronic Notes in Theoretical Computer Science, 2001, 46, pp.177-187. ⟨10.1016/S1571-0661(04)80985-X⟩
Electronic Notes in Theoretical Computer Science, Elsevier, 2001, 46, pp.177-187
Electronic Notes in Theoretical Computer Science, 2001, 46, pp.177-187. ⟨10.1016/S1571-0661(04)80985-X⟩
International audience; In this article we characterize bipartite graphs whose associated neighborhood hypergraphs have the Helly property. We examine incidence graphs both hypergraphs and linear hypergraphs and we give a polynomial algorithm to reco
Publikováno v:
Journal of Parallel and Distributed Computing. 56:47-70
In this paper we describe scalable parallel algorithms for building the convex hull and a triangulation ofncoplanar points. These algorithms are designed for thecoarse grained multicomputermodel:pprocessors withO(n/p)?O(1) local memory each, connecte
Publikováno v:
International Journal of Pattern Recognition and Artificial Intelligence. 11:1065-1084
Over recent years clusters of workstations have begun to replace systems of mainframes. These workstations can be used to behave as a parallel machine, and then could supply supercomputing performance at modest cost. We report an experiment of such a
Publikováno v:
International Journal of Distributed Sensor Networks
International Journal of Distributed Sensor Networks, 2013, 2013, 12 p. ⟨10.1155/2013/745069⟩
International Journal of Distributed Sensor Networks, Hindawi Publishing Corporation, 2013, 2013, 12 p. ⟨10.1155/2013/745069⟩
International Journal of Distributed Sensor Networks, Vol 9 (2013)
International Journal of Distributed Sensor Networks, 2013, 2013, 12 p. ⟨10.1155/2013/745069⟩
International Journal of Distributed Sensor Networks, Hindawi Publishing Corporation, 2013, 2013, 12 p. ⟨10.1155/2013/745069⟩
International Journal of Distributed Sensor Networks, Vol 9 (2013)
International audience; ireless sensor networks (WSNs) are composed of a large number of low-cost, low-power, and multi-functional sensor nodes that communicate at short distance through wireless links. They are usually deployed in an open and uncont
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8b306113ad8f86a513fede80c84f4141
https://inria.hal.science/hal-00918969
https://inria.hal.science/hal-00918969
Autor:
Stéphane Ubéda
Publikováno v:
Pattern Recognition. 28:1993-2000
We propose a parallel thinning algorithm for binary pictures. Given an N x N binary image including an object, our algorithm computes in O(N^2) the skeleton of the object, using a pyramidal decomposition of the picture. The behavior of this algorithm
Publikováno v:
AGERE!@SPLASH
AGERE 2012
AGERE 2012, Oct 2012, Tucson, Arizona, United States
AGERE 2012
AGERE 2012, Oct 2012, Tucson, Arizona, United States
International audience; Applications running over decentralized systems, distribute their computation on nodes/agents, which exchange data and services through messages. In many cases, the provenance of the data or service is not relevant, and applic
Autor:
Stéphane Ubéda, Afonso Ferreira
Publikováno v:
Pattern Recognition. 27:867-878
This paper proposes a parallel algorithm for contour tracking of binary pictures. Given an object contour composed by O(N) pixels, our algorithm computes in constant time the next layer of the contour of that object, using the weakest parallel model,
Autor:
Stéphane Ubéda
Publikováno v:
International Journal of Pattern Recognition and Artificial Intelligence. :1103-1114
Thinning algorithms are widely used in pattern recognition. This processing stage is implemented on serial machines as well as on parallel machines. We can find two classes of thinning algorithms in the literature. The first class is composed of stro