Exploració per títol
Ara es mostren els items 22905-22924 de 244457
-
Approximate Dirichlet boundary conditions in time-evolving physical domains
(Universitat Politècnica de Catalunya, 2016-06-23)
Projecte Final de Màster Oficial
Accés obertIn many coupled fluid-structure problems of practical interest the domain of at least one of the problems evolves in time. The most often applied approach to deal with such motion in numerical methods is the use of the ... -
Approximate formulae for a logic that capture classes of computational complexity
(Oxford University Press, 2009-02)
Article
Accés obertThis paper presents a syntax of approximate formulae suited for the logic with counting quantifiers SOLP. This logic was formalised by us in [1] where, among other properties, we showed the following facts: (i) In the ... -
Approximate fuzzy preorders and equivalences
(2009)
Text en actes de congrés
Accés restringit per política de l'editorialAlthough Fuzzy Preorders and Fuzzy Equivalences are well established types of fuzzy relations, they are defined in terms of properties to be fulfilled in a crisp way. In this paper we relax those requirements by making ... -
Approximate nearest neighbour search with the fukunaga & narendra algorithm
(Universitat Politècnica de Catalunya, 2011-09-05)
Projecte Final de Màster Oficial
Accés obertEnglish: Nearest neighbour search is the one of the most simple and used technique in Pattern Recognition due to its simplicity and its good behaviour.. Many fast NN search algorithm have been developed during last years. ... -
Approximate partitioning of observations in hierarchical particle filter body tracking
(2011)
Text en actes de congrés
Accés restringit per política de l'editorialThis paper presents a model-based hierarchical particle filtering algorithm to estimate the pose and anthropometric parameters of humans in multi-view environments. Our method incorporates a novel likelihood measurement ... -
Approximate policy iteration using regularized Bellman residuals minimization
(Taylor & Francis, 2016)
Article
Accés obertReinforcement Learning (RL) provides a general methodology to solve complex uncertain decision problems, which are very challenging in many real-world applications. RL problem is modeled as a Markov Decision Process (MDP) ... -
Approximate projection method for the incompressible Navier–Stokes equations
(2016-07)
Article
Accés obert -
Approximate results for rainbow labelings
(2017-03)
Article
Accés obertA simple graph G=(V,E) is said to be antimagic if there exists a bijection f:E¿[1,|E|] such that the sum of the values of f on edges incident to a vertex takes different values on distinct vertices. The graph G is distance ... -
Approximate results for rainbow labelings
(2015-04-14)
Report de recerca
Accés obert -
Approximate sampling and counting for spin models in graphs
(Universitat Politècnica de Catalunya, 2023-05)
Treball Final de Grau
Accés obert
Realitzat a/amb: Georgia Institute of TechnologyEn aquest treball abordem els problemes de mostreig i comptatge aproximat en models d'espins en grafs, recopilant els resultats més significatius de l'àrea i introduïnt els coneixements previs necessaris del camp de la ... -
Approximate string matching algorithms in art media archives
(Universitat Politècnica de Catalunya, 2009-05-18)
Projecte/Treball Final de Carrera
Accés obert
Realitzat a/amb: Akademia Górniczo-Hutnicza im. S. Staszica w KrakowieThe implementation of a distributed electronic art platform with a considerable amount of data available involves some technical challenges. Due to the lack of a common European platform for media art, the European ... -
Approximate task memoization
(Universitat Politècnica de Catalunya, 2016-10)
Projecte Final de Màster Oficial
Accés restringit per acord de confidencialitat -
Approximate Wasserstein attraction flows for dynamic mass transport over networks
(2022-09-01)
Article
Accés restringit per política de l'editorialThis paper presents a Wasserstein attraction approach for solving dynamic mass transport problems over networks. In the transport problem over networks, we start with a distribution over the set of nodes that needs to be ... -
Approximating a Multi-Grid Solver
(IEEE, 2019-02-14)
Comunicació de congrés
Accés obertMulti-grid methods are numerical algorithms used in parallel and distributed processing. The main idea of multigrid solvers is to speedup the convergence of an iterative method by reducing the problem to a coarser grid a ... -
Approximating arbitrary fuzzy subsets by extensional ones
(2015-06-01)
Article
Accés obertAn interesting problem within the theory of indistinguishability operators is how to approximate an arbitrary fuzzy subset by a similar extensional one. In this paper, we aim to solve this question and provide three methods ... -
Approximating convex quadratic programming is P-complete
(1995)
Report de recerca
Accés obertIn this paper we show that the problem of Approximating Convex Quadratic Programming is P-complete. We also consider two approximation problems related to it, Solution Approximation and Value Approximation and show both ... -
Approximating displacements in R^3 by rotations in R^4 and its application to pointcloud registration
(Institute of Electrical and Electronics Engineers (IEEE), 2022)
Article
Accés obertNo proper norm exists to measure the distance between two object poses essentially because a general pose is defined by a rotation and a translation, and thus it involves magnitudes with different units. As a means to solve ... -
Approximating fault detection linear interval observers using -order interval predictors
(2017-07-01)
Article
Accés obertInterval observers can be described by an autoregressive-moving-average model while ¿-order interval predictors by a moving-average model. Because an autoregressive-moving-average (ARMA) model can be approximated by a ... -
Approximating fuzzy preorders and equivalences. A similarity based approach
(IEEE Computer Society Publications, 2010)
Text en actes de congrés
Accés obert -
Approximating layout problems on geometric random graphs
(1998-10-13)
Report de recerca
Accés obertWe show two simple algorithms that, with high probability, approximate within a constant several layout problems for geometric random graphs drawn from the Gn(r) model r_cv(log¿¿n/n¿ ) for any constant c = 6. The layout ...