• OSWALDO: observación de la docencia entre iguales

  Moreno, Verónica; Hernández Leo, Davinia; Oliver, Miquel; Atienza, Encarna (CIDUI Congrés Internacional de Docència Universitària i Innovació, 2018)

  OSWALDO nace con el objetivo de promover, facilitar y acompañar en la práctica reflexiva de la mejora docente a través de un sistema de observación entre iguales. El proyecto dispone de recursos e instrumentos de apoyo ...
• La construcción de la identidad profesional en Ingenieria TIC: el impacto del programa formativo

  Moreno Oliver, Verónica; Hernández Leo, Davinia; Khosronejad, Maryam (CIDUI Congrés Internacional de Docència Universitària i Innovació, 2018)

  Este trabajo presenta los resultados de un estudio cualitativo comparado realizado con alumnado de Ingeniería de la Universitat Pompeu Fabra (UPF) Barcelona (primer curso y graduados) que tenía por objetivo conocer el ...
• Cutting up is hard to do: the parameterised complexity of k-Cut and related problems

  Downey, Rodney G. (Elsevier, 2003)

  The Graph k-Cut problem is that of finding a set of edges of minimum total weight, in an edge-weighted graph, such that their removal from the graph results in a graph having at least k connected components. An algorithm ...
• FDOT reconstruction and setting optimization using singular value analysis with automatic thresholding

  Chamorro Servent, Judit; Aguirre, Juan; Ripoll, Jorge; Vaquero, Juan J.; Deseo, Manuel (Institute of Electrical and Electronics Engineers (IEEE), 2009)

  Fluorescence Enhanced Diffuse Optical Tomography (FDOT) retrieves 3D distributions of fluorophore concentration in small animals, non-invasively and in vivo. The FDOT problem can be formulated as a system of equations, ...
• Branching and pruning: an optimal temporal POCL planner based on constraint programming

  Vidal, Vincent; Geffner, Héctor (Elsevier, 2006)

  A key feature of modern optimal planners such as graphplan and blackbox is their ability to prune large parts of the search space. Previous Partial Order Causal Link (POCL) planners provide an alternative branching scheme ...
• The Variational Garrote

  Kappen, Hilbert J.; Gómez, Vicenç (Springer, 2014)

  We analyze the variational method for sparse regression using ℓ 0 regularization. The variational approximation results in a model that is similar to Breiman’s Garrote model. We refer to this method as the Variational ...
• Forming social impressions from voices in native and foreign languages

  Baus, Cristina; McAleer, Phil; Marcoux, Katherine; Belin, Pascal; Costa, Albert, 1970- (Nature Research, 2019)

  We form very rapid personality impressions about speakers on hearing a single word. This implies that the acoustical properties of the voice (e.g., pitch) are very powerful cues when forming social impressions. Here, we ...
• Heuristics for planning with penalties and rewards formulated in logic and computed through circuits

  Bonet, Blai; Geffner, Héctor (Elsevier, 2008)

  The automatic derivation of heuristic functions for guiding the search for plans is a fundamental technique in planning. The type of heuristics that have been considered so far, however, deal only with simple planning ...
• A combinatorial characterization of resolution width

  Atserias, Albert; Dalmau, Víctor (Elsevier, 2008)

  We provide a characterization of the resolution width introduced in the context of propositional proof complexity in terms of the existential pebble game introduced in the context of finite model theory. The characterization ...
• Blended MOOCs: university teachers’ perspective

  Albó Pérez, Laia; Hernández Leo, Davinia; Oliver Riera, Miquel (CEUR Workshop Proceedings, 2015)

  Blended Massive Open Online Courses (bMOOCs) have arisen as a blended learning strategy that combines the use of MOOC platform-supported activities and video-based content with in-class face-to-face activities in ...
• Training parsers by inverse reinforcement learning

  Neu, Gergely; Szepesvári, Csaba (Springer, 2009)

  One major idea in structured prediction is to assume that the predictor computes its output by finding the maximum of a score function. The training of such a predictor can then be cast as the problem of finding weights ...
• Optimal control as a graphical model inference problem

  Kappen, Hilbert J.; Gómez, Vicenç; Opper, Manfred (Springer, 2012)

  We reformulate a class of non-linear stochastic optimal control problems introduced by Todorov (in Advances in Neural Information Processing Systems, vol. 19, pp. 1369-1376, 2007) as a Kullback-Leibler (KL) minimization ...
• Datalog and constraint satisfaction with infinite templates

  Bodirsky, Manuel; Dalmau, Víctor (Elsevier, 2013)

  On finite structures, there is a well-known connection between the expressive power of Datalog, finite variable logics, the existential pebble game, and bounded hypertree duality. We study this connection for infinite ...
• Inversion of a large-scale circuit model reveals a cortical hierarchy in the dynamic resting human brain

  Wang, Peng; Kong, Ru; Kong, Xiaolu; Liégeois, Raphaël; Orban, Csaba; Deco, Gustavo; Yeo, Thomas BT (American Association for the Advancement of Science (AAAS), 2019)

  We considered a large-scale dynamical circuit model of human cerebral cortex with region-specific microscale properties. The model was inverted using a stochastic optimization approach, yielding markedly better fit to new, ...
• Retractions onto series-parallel posets

  Dalmau, Víctor; Krokhin, Andrei; Larose, Benoit (Elsevier, 2008)

  The poset retraction problem for a poset P is whether a given poset Q containing P as a subposet admits a retraction onto P, that is, whether there is a homomorphism from Q onto P which fixes every element of P. We study ...
• Majority constraints have bounded pathwidth duality

  Dalmau, Víctor; Krokhin, Andrei (Elsevier, 2008)

  We study certain constraint satisfaction problems which are the problems of deciding whether there exists a homomorphism from a given relational structure to a fixed structure with a majority polymorphism. We show that ...
• Towards a dichotomy theorem for the counting constraint satisfaction problem

  Bulatov, Andrei A.; Dalmau, Víctor (Elsevier, 2007)

  The Counting Constraint Satisfaction Problem (#CSP) can be expressed as follows: given a set of variables, a set of values that can be taken by the variables, and a set of constraints specifying some restrictions on the ...
• Learning intersection-closed classes with signatures

  Bulatov, Andrei; Chen, Hubie; Dalmau, Víctor (Elsevier, 2007)

  Intersection-closed classes of concepts arise naturally in many contexts and have been intensively studied in computational learning theory. In this paper, we study intersection-closed classes that contain the concepts ...
• Planning as heuristic search

  Bonet, Blai; Geffner, Héctor (Elsevier, 2001)

  In the AIPS98 Planning Contest, the hsp planner showed that heuristic search planners can be competitive with state-of-the-art Graphplan and sat planners. Heuristic search planners like hsp transform planning problems into ...
• Phase transitions of PP-complete satisfiability problems

  Bailey, Delbert D.; Dalmau, Víctor; Kolaitis, Phokion G. (Elsevier, 2007)

  The complexity class PP consists of all decision problems solvable by polynomial-time probabilistic Turing machines. It is well known that PP is a highly intractable complexity class and that PP-complete problems are in ...

Mostra'n més