Zobrazeno 1 - 10
of 17
pro vyhledávání: '"Jorge Artieda"'
Autor:
Manolo Muñoz-Espinosa, Jorge Artieda-Rojas, Santiago Espinosa-Vaca, Segundo Curay-Quispe, Marco Pérez-Salinas, Oscar Nuñez-Torres, Rafael Mera-Andrade, Hernán Zurita-Vásquez, Giovanny Valátegui-Espin, Pedro Pomboza-Tamaquiza, Anselmo Carrasco-Silva, Marcos Antonio Barros-Rodriguez
Publikováno v:
Tropical and Subtropical Agroecosystems, Vol 19, Iss 2 (2016)
The inappropriate use of agrochemicals and technologies in farming systems can cause an accelerated deterioration of agricultural and soil pollution. Thus, agriculture and livestock are becoming an environmental problem in the world, which implies th
Externí odkaz:
https://doaj.org/article/a995533fec2b42c3a7efdb8a6fc5b6a8
Publikováno v:
Computers & Operations Research. 92:37-46
The maximal clique enumeration (MCE) problem has numerous applications in biology, chemistry, sociology, and graph modeling. Though this problem is well studied, most current research focuses on finding solutions in large sparse graphs or very dense
Publikováno v:
Optimization Methods and Software. 32:312-335
This paper describes BBMCW, a new efficient exact maximum clique algorithm tailored for large sparse graphs which can be bit-encoded directly into memory without a heavy performance penalty. These graphs occur in real-life problems when some form of
Publikováno v:
Computers & operations research 110 (2019): 18–33. doi:10.1016/j.cor.2019.05.017
info:cnr-pdr/source/autori:San Segundo, Pablo; Furini, Fabio; Artieda, Jorge/titolo:A new branch-and-bound algorithm for the Maximum Weighted Clique Problem/doi:10.1016%2Fj.cor.2019.05.017/rivista:Computers & operations research/anno:2019/pagina_da:18/pagina_a:33/intervallo_pagine:18–33/volume:110
info:cnr-pdr/source/autori:San Segundo, Pablo; Furini, Fabio; Artieda, Jorge/titolo:A new branch-and-bound algorithm for the Maximum Weighted Clique Problem/doi:10.1016%2Fj.cor.2019.05.017/rivista:Computers & operations research/anno:2019/pagina_da:18/pagina_a:33/intervallo_pagine:18–33/volume:110
We study the Maximum Weighted Clique Problem (MWCP), a generalization of the Maximum Clique Problem in which weights are associated with the vertices of a graph. The MWCP calls for determining a complete subgraph of maximum weight. We design a new co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bd6336fd3b340a63ff71a69e91d4f6f4
Publikováno v:
Optimization Letters. 11:343-358
This paper describes BBMCPara, a new parallel exact maximum clique algorithm tailored for large and massive sparse graphs. The paper first presents a sequential algorithm BBMCSP, which builds on ideas from a leading bit-parallel published algorithm f
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319514680
MOD
MOD
There has been a rising interest in experimental exact algorithms for the maximum clique problem because the gap between the expected theoretical performance and the reported results in practice is becoming surprisingly large. One reason for this is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::472e5a6c4c98a36e33bab8cb8b4d7a68
https://doi.org/10.1007/978-3-319-51469-7_26
https://doi.org/10.1007/978-3-319-51469-7_26
Autor:
Pablo San Segundo, Jorge Artieda
Publikováno v:
Digital.CSIC. Repositorio Institucional del CSIC
instname
instname
© 2015, Springer Science+Business Media New York. This paper presents CCMM (acronym for image Clique Matching), a new deterministic algorithm for the visual feature matching problem when images have low distortion. CCMM is multi-hypothesis, i.e. for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d366f7bf17b06db687468b41181db439
http://hdl.handle.net/10261/129444
http://hdl.handle.net/10261/129444
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540698111
ICIAR
ICIAR
This article presents a method for cooperative reconstruction of three-dimensional scenes using multiple views. Although the use of multiple views is one of the most applied in the 3D scenes interpretation, its use with a single mobile robot does not
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::27babf0332a95a5f0e039fb2d954500e
https://doi.org/10.1007/978-3-540-69812-8_39
https://doi.org/10.1007/978-3-540-69812-8_39
Autor:
Juan F. Correa, Miguel Olivares, Carol Martinez, Pascual Campoy, Luis Mejias, Jorge Artieda, Iván F. Mondragón
Publikováno v:
Journal of Intelligent and Robotic Systems
Journal of Intelligent and Robotic Systems, ISSN 0921-0296, 2008-03, Vol. 54, No. 1-3
BASE-Bielefeld Academic Search Engine
Archivo Digital UPM
Universidad Politécnica de Madrid
Journal of Intelligent and Robotic Systems, ISSN 0921-0296, 2008-03, Vol. 54, No. 1-3
BASE-Bielefeld Academic Search Engine
Archivo Digital UPM
Universidad Politécnica de Madrid
Computer vision is much more than a technique to sense and recover environmental information from an UAV. It should play a main role regarding UAVs' functionality because of the big amount of information that can be extracted, its possible uses and a
Autor:
Enrique Lillo, Rodrigo San Martin, Pedro Gutierrez, Jorge Artieda, Jaime del-Cerro, Antonio Barrientos
Publikováno v:
2006 IEEE International Conference on Mechatronics.
This work describes the hardware and software architectures used for controlling an Unmanned Aerial Vehicle (UAV). It has successfully operated for more than a hundred flight hours. The main aim of this work is to allow quick development and test of