Exploració per títol

Ara es mostren els items 12101-12120 de 245790

    • Algorithmically efficient syntactic characterization of possibility domains 

      Díaz Cort, Josep; Kirousis, Lefteris; Kokonezi, Sofia; Livieratos, John (2019-10-10)
      Article
      Accés obert
      In the field of Judgment Aggregation, a domain, that is a subset of a Cartesian power of {0, 1}, is considered to reflect abstract rationality restrictions on vectors of two-valued judgments on a number of issues. We are ...

    • Algorithms and graphic interface design to control and teach a humanoid robot through human imitation 

      Rosanes Siscart, Marc Josep (Universitat Politècnica de Catalunya, 2011-04-11)
      Projecte Final de Màster Oficial
      Accés obert
      Given that human-like robots are finding their place in different areas of our world, research is being carried out in order to improve human-robot interaction. Humanoid robots not only require a human appearance but also ...

    • Algorithms and methodologies for interconnect reliability analysis of integrated circuits 

      Jain, Palkesh (Universitat Politècnica de Catalunya, 2017-05-05)
      Tesi
      Accés obert
      The phenomenal progress of computing devices has been largely made possible by the sustained efforts of semiconductor industry in innovating techniques for extremely large-scale integration. Indeed, gigantically integrated ...

    • Algorithms and Methods for Robust Geodetic kinematic Positioning 

      Talaya López, Julià (Universitat Politècnica de Catalunya, 2003-06-27)
      Tesi
      Accés obert
      El sistema NAVSTAR/GPS ha desenvolupat un paper molt important en les tècniques de posicionament cinemàtic geodèsiques, especialment en la determinació de la trajectòries per a la orientació de sensors aerotransportats ...

    • Algorithms and structures for source separation based on the constant modulus property 

      Cerquides Bueno, Jose Ramon; Fernández Rubio, Juan Antonio (1996)
      Text en actes de congrés
      Accés obert
      We propose two structures and theirs associated algorithms designed to solve the blind source separation problem in the presence of noise and interferences. Both structures exploit the non convexity of the Constant Modulus ...

    • Algorithms and tools for the automatic scanning of mid-complexity 3D objects 

      Carruesco Llorens, Àlex (Universitat Politècnica de Catalunya, 2016-07-04)
      Projecte Final de Màster Oficial
      Accés obert
      We designed and implemented an automatic 3D scanning system for acquiring 3D models from mid-complexity objects. The system includes the acquisition of the data, the processing steps, and the mesh reconstruction. We also ...

    • Algorithms for a multi-projector CAVE system 

      Tibau, Javier (Universitat Politècnica de Catalunya, 2010-09)
      Projecte Final de Màster Oficial
      Accés obert
      With regards to facilitating development of VR applications, the main pur- pose of ALIVE is to reduce the amount of attention that the application developer has to dedicate to the issues that were described previously. ...

    • Algorithms for B wave detection 

      Ramon Maldonado, Eduard (Universitat Politècnica de Catalunya, 2013-04-09)
      Projecte/Treball Final de Carrera
      Accés obert
      Realitzat a/amb:   Rheinisch-Westfälische Technische Hochschule Aachen
      [ANGLÈS] The objective of this Master Thesis was to develop algorithms for B waves detection in ICP. This goal was approached by two different methods that depend basically in the resolution of the acquired ICP. Then, both ...

    • Algorithms for chow-heegner points via iterated integrals 

      Darmon, Henri; Daub, Michael; Lichtenstein, Sam; Rotger Cerdà, Víctor (2015)
      Article
      Accés restringit per política de l'editorial
      Let E/Q be an elliptic curve of conductor N and let f be the weight 2 newform on G0(N) associated to it by modularity. Building on an idea of S. Zhang, an article by Darmon, Rotger, and Sols describes the construction of ...

    • Algorithms for classification based on k-NN 

      Laguía, Manuel; Castro, Juan L. (Universitat Politècnica de Catalunya. Secció de Matemàtiques i Informàtica, 2007)
      Article
      Accés obert
      In this paper we focus on methods that solve classification tasks based on distances, and we introduce some variants of the basic k-NN method adding up to 3 characteristics. The experiments reveal a relationship between ...

    • Algorithms for energy disaggregation 

      Fiol Arguimbau, Albert (Universitat Politècnica de Catalunya, 2016-07-08)
      Projecte Final de Màster Oficial
      Accés obert
      In this project we compare three different solutions to the energy disaggregation problem. We test the algorithms on a reference dataset, and try to learn about the requirements and feasibility of energy disaggregation as ...

    • Algorithms for flexible multi-standard array processing: FDD mode of UTRA 

      Antón Haro, Carles; Rodríguez Fonollosa, Javier (1999)
      Text en actes de congrés
      Accés obert

    • Algorithms for learning finite automata from queries: a unified view 

      Balcázar Navarro, José Luis; Díaz Cort, Josep; Gavaldà Mestre, Ricard; Watanabe, Osamu (1996-09)
      Report de recerca
      Accés obert
      In this survey we compare several known variants of the algorithm for learning deterministic finite automata via membership and equivalence queries. We believe that our presentation makes it easier to understand what ...

    • Algorithms for Process Conformance and Process Refinement 

      Muñoz-Gama, Jorge (Universitat Politècnica de Catalunya, 2010-09)
      Projecte Final de Màster Oficial
      Accés obert
      Process Conformance is a crucial step in the area of Process Mining: the adequacy of a model derived from applying a discovery algorithm to a log must be certified before making further decisions that affect the system ...

    • Algorithms for sampling spanning trees uniformly at random 

      Costantini, Lucia (Universitat Politècnica de Catalunya, 2020-07)
      Projecte Final de Màster Oficial
      Accés obert
      Thesis on the analysis of various algorithms for sampling spanning trees of a graph uniformly at random.

    • Algorithms for swarm robotics on mobile robotic station : pushing and connecting 

      Cárdenas Álvarez, Pedro Pablo (Universitat Politècnica de Catalunya, 2012)
      Treball Final de Grau
      Accés restringit per decisió de l'autor
      Realitzat a/amb:   Nottingham Trent University
      Swarm robots are constrained in their long-term due to a limited power supply. Normally, rechargeable batteries are utilized that may only provide a few hours. A mobile charging station is required. Also, algorithms are ...

    • Algorithms for the linear coloring arrangement problem 

      Sánchez Barrera, Isaac (Universitat Politècnica de Catalunya, 2015-01-28)
      Treball Final de Grau
      Accés obert
      [CATALÀ] El projecte emprèn la tasca de desenvolupar algorismes eficients per resoldre o aproximar el problema de l'arranjament lineal mínim d'una coloració per a graphs, variació del MinLA. Aquí, l'assignació lineal està ...

    • Algorithms for the reconstruction, analysis, repairing and enhancement of 3D urban models from multiple data sources 

      Comino Trinidad, Marc (Universitat Politècnica de Catalunya, 2020-12-22)
      Tesi
      Accés obert
      Over the last few years, there has been a notorious growth in the field of digitization of 3D buildings and urban environments. The substantial improvement of both scanning hardware and reconstruction algorithms has led ...

    • Algorithms for the restricted linear coloring arrangement problem 

      Llop Palao, Joan (Universitat Politècnica de Catalunya, 2019-07-04)
      Treball Final de Grau
      Accés obert
      The aim of this project is to develop efficient algorithms for solving or approximating the Minimum Restricted Linear Coloring Arrangement Problem. It is the first approach to its algorithms, and we will face the problem ...

    • Algorithms for the weighted independent domination problem 

      Rodríguez Corominas, Guillem (Universitat Politècnica de Catalunya, 2019-07-04)
      Treball Final de Grau
      Accés obert
      El problema de la dominació independent ponderada és un problema NP-hard d'optimització combinatòria en grafs. Aquest problema només ha estat abordat a la literatura per enfocaments de programació lineal entera, heurístiques ...