L'objectiu del grup és la producció de contribucions rellevants en les àrees d'expertesa dels components del grup i la seva disseminació en revistes i conferències internacionals de prestigi reconegut. És voluntat del grup que les contribucions tinguin un impacte significatiu a llarg termini. La transferència de tecnologia és considerada com una conseqüència de l'excel·lència en la recerca i s'ha de portar a terme com un mitjà per incrementar l'impacte dels resultats, obtenir recursos per al grup i explorar nous temes per a la recerca en el futur.

http://futur.upc.edu/ALBCOM

The primary goal is to produce relevant contributions in the areas of expertise of the group and to disseminate them in renowned international journals and conferences. It is the group's aim that these contributions have a tangible and long-term impact on the scientific community. Technology transfer is considered a byproduct of research excellence and should be sought as a means of increasing the impact of the results, obtaining resources for the group and envisioning new directions for future research.

http://futur.upc.edu/ALBCOM

The primary goal is to produce relevant contributions in the areas of expertise of the group and to disseminate them in renowned international journals and conferences. It is the group's aim that these contributions have a tangible and long-term impact on the scientific community. Technology transfer is considered a byproduct of research excellence and should be sought as a means of increasing the impact of the results, obtaining resources for the group and envisioning new directions for future research.

http://futur.upc.edu/ALBCOM

Enviaments recents

  • Evolution of tandem repeat satellite sequences in two closely related caenorhabditis species: Diminution of satellites in hermaphrodites 

    Subirana Torrent, Juan A.; Messeguer Peypoch, Xavier (2017-12-01)
    Article
    Accés obert
    The availability of the genome sequence of the unisexual (male-female) Caenorhabditis nigoni offers an opportunity to compare its non-coding features with the related hermaphroditic species Caenorhabditis briggsae; to ...
  • Centrality measure in social networks based on linear threshold model 

    Riquelme Csori, Fabián; Gonzalez Cantergiani, Pablo; Molinero Albareda, Xavier; Serna Iglesias, María José (2018-01-15)
    Article
    Accés restringit per política de l'editorial
    Centrality and influence spread are two of the most studied concepts in social network analysis. In recent years, centrality measures have attracted the attention of many researchers, generating a large and varied number ...
  • Proof complexity meets algebra 

    Atserias, Albert; Ochremiak, Joanna (Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017)
    Text en actes de congrés
    Accés obert
    We analyse how the standard reductions between constraint satisfaction problems affect their proof complexity. We show that, for the most studied propositional and semi-algebraic proof systems, the classical constructions ...
  • Examples of CF-bi-inmune and CF-levelable sets in LOGSPACE 

    Balcázar Navarro, José Luis; Díaz Cort, Josep; Gabarró Vallès, Joaquim (1984)
    Report de recerca
    Accés obert
    We find sets in the class LOGSPACE (on-line) that do not have good respectively approximations by context-free languages. For that we introduce the languages CF-bi-inmune and CF-levelable. We prove the results by defining ...
  • Connections among non uniform models for problems requiring high amount of resources 

    Balcázar Navarro, José Luis; Gabarró Vallès, Joaquim (1985-11)
    Report de recerca
    Accés obert
    We characterize in terms of oracle Turing machines the classes defined by exponential lower bounds on some nonuniform complexity measures. After, we use the same methods to give a new characterization of classes defined ...
  • Complements des facteurs gauches de mots infinis et ambiguité : quelques exemples 

    Autebert, Jean-Michel; Gabarró Vallès, Joaquim (1985)
    Report de recerca
    Accés obert
    On se propose d'utiliser la méthode que P. Flajolet a décrit pour prouver l'ambiguité du langage de Goldstine [5], afin de prouver l'ambiguité d'une série de langages du même type. Ces langages sont tous des complémentaires ...
  • On some "non uniform" complexity measures 

    Balcázar Navarro, José Luis; Díaz Cort, Josep; Gabarró Vallès, Joaquim (1985)
    Report de recerca
    Accés obert
    Non-uniform complexity measures origined in Automata and Formal Languages Theory are characterized in terms of well-known uniform complexity classes. The initial index of languages is introduced by means of several ...
  • Dos problemas 

    Gabarró Vallès, Joaquim (1985-09)
    Report de recerca
    Accés obert
  • About log-on languages : preliminary version 

    Cases Muñoz, Rafael; Gabarró Vallès, Joaquim (1985)
    Report de recerca
    Accés obert
    We deal with on-line log-space Turing Machines with markers in the work tapes. In this type of machines we prove the existence of a language L satisfying L ϵ NSPACE_s (log⁡ n) , L ̅ ϵ NSPACE_s (log⁡ n) and L ϵ NSPACE_s ...
  • Uniform characterizations of non-uniform complexity measures 

    Balcázar Navarro, José Luis; Díaz Cort, Josep; Gabarró Vallès, Joaquim (1985)
    Report de recerca
    Accés obert
    The class PSPACE/ply of sets decided within polynomial space by machines with polynomial advices is characterized in several way: we give an algebraic characterization, a parallel model characterization. Finally we define ...
  • Keeping control transfer instructions out of the pipeline in architectures without condition codes 

    Cortadella Fortuny, Jordi; Llaberia Griñó, José M.; González Colás, Antonio María (1987-05)
    Report de recerca
    Accés obert
    The execution of branch instructions involves a loss of performance in pipelined processors. In this paper we present a mechanism for executing this kind of instruction with a zero delay. This mechanism has been proposed ...
  • On unification over unrestricted pairs of trees 

    Cases Muñoz, Rafel; Díaz Cort, Josep (1989-01)
    Report de recerca
    Accés obert
    In this work, we deal with the unification of unrestricted (i.e. inifiable and non-unifiable) pais of binary trees with uniform probability distribution. The following results are obtained: Almost all pairs of binary trees ...

Mostra'n més