Exploració per autor "Balcázar Navarro, José Luis"
Ara es mostren els items 15-34 de 79
-
Border algorithms for computing Hasse diagrams of arbitrary lattices
Balcázar Navarro, José Luis; Tirnauca, Cristina (Springer, 2011)
Text en actes de congrés
Accés restringit per política de l'editorialLattices are mathematical structures with many applications in computer science; among these, we are interested in fields like data mining, machine learning, or knowledge discovery in databases. One well-established use ... -
CALCULABILITAT (Examen 2n quadrim)
Balcázar Navarro, José Luis (Universitat Politècnica de Catalunya, 1999-06-10)
Examen
Accés restringit a la comunitat UPC -
CALCULABILITAT (Examen 2n quadrim)
Balcázar Navarro, José Luis (Universitat Politècnica de Catalunya, 1998-06-10)
Examen
Accés restringit a la comunitat UPC -
Canonical Horn representations and query learning
Arias Vicente, Marta; Balcázar Navarro, José Luis (2009-05)
Report de recerca
Accés obertWe describe an alternative construction of an existing canonical representation for definite Horn theories, the emph{Guigues-Duquenne} basis (or GD basis), which minimizes a natural notion of implicational size. We extend ... -
Characterization and Armstrong relations for Degenerated Multivalued Dependencies using Formal Concept Analysis
Baixeries i Juvillà, Jaume; Balcázar Navarro, José Luis (Springer, 2005)
Text en actes de congrés
Accés restringit per política de l'editorialFunctional dependencies, a notion originated in Relational Database Theory, are known to admit interesting characterizations in terms of Formal Concept Analysis. In database terms, two successive, natural extensions of ... -
Characterizations of logarithmic advice complexity classes
Balcázar Navarro, José Luis; Hermo Huguet, Montserrat; Mayordomo, Elvira (1991-12-13)
Report de recerca
Accés obertThe complexity classes P/log and Full-P/log, corresponding to the two standard forms of logarithmic advice for polynomial time, are studied. Characterizations are found in terms of Kolmogorov-simple circuits, bounded query ... -
Characterizing the learnability of Kolmogorov easy circuit expressions
Balcázar Navarro, José Luis; Buhrman Canal, Harry (1996-01)
Report de recerca
Accés obertWe show that Kolmogorov easy circuit expressions can be learned with membership queries in polynomial time if and only if every NE-predicate is E-solvable. Moreover we show that the previously known algorithm, that uses ... -
Closed-set-based discovery of representative association rules
Tîrnauca, Cristina; Balcázar Navarro, José Luis; Gómez Pérez, Domingo (2020)
Article
Accés obertThe output of an association rule miner is often huge in practice. This is why several concise lossless representations have been proposed, such as the “essential” or “representative” rules. A previously known algorithm ... -
Closed-set-based discovery of representative association rules revisited
Balcázar Navarro, José Luis; Tirnauca, Cristina (Hermann Éditions, 2011)
Text en actes de congrés
Accés obertThe output of an association rule miner is often huge in practice. This is why several concise lossless representations have been proposed, such as the “essential” or “representative” rules. We revisit the algorithm given ... -
Closures and partial implications in educational data mining
García Sáiz, Diego; Zorrilla Pantaleón, Marta Elena; Balcázar Navarro, José Luis (CEUR Workshop Proceedings, 2012)
Text en actes de congrés
Accés obertEducational Data Mining (EDM) is a growing field of use of data analysis techniques. Speci fically, we consider partial implications. The main problems are, fi rst, that a support threshold is absolutely necessary but ... -
Co-occurrence patterns in diagnostic data
Piceno Cabrera, Marie Ely; Rodríguez Navas, Laura; Balcázar Navarro, José Luis (Wiley (John Wiley & Sons), 2021-11)
Article
Accés obertWe demonstrate how graph decomposition techniques can be employed for the visualization of hierarchical co-occurrence patterns between medical data items. Our research is based on Gaifman graphs (a mathematical concept ... -
Coding complexity: the computational complexity of succinct descriptions
Balcázar Navarro, José Luis; Gavaldà Mestre, Ricard; Watanabe, Osamu (1996-09)
Report de recerca
Accés obertFor a given set of strings, the problem of obtaining a succinct description becomes an important subject of research, related to several areas of theoretical computer science. In structural complexity theory, researchers ... -
Competencias profesionales para el Grado en Ingeniería Informática
Sánchez Carracedo, Fermín; Sancho Samsó, María Ribera; Botella López, Pere; García Almiñana, Jordi; Aluja Banet, Tomàs; Navarro Guerrero, Juan José; Balcázar Navarro, José Luis (IEEE, Sociedad de Educación: Capítulos Español, Portugués y Colombiano, 2009)
Capítol de llibre
Accés obertDegrees in the EHEA (European Higher Education Area) must be designed based on professional skills, so that when the students finish their studies they become competent professionals in the labour market. In this paper we ... -
Compressibility of infinite binary sequences
Balcázar Navarro, José Luis; Gavaldà Mestre, Ricard; Hermo Huguet, Montserrat (1996-02-06)
Report de recerca
Accés obertIt is known that infinite binary sequences of constant Kolmogorov complexity are exactly the recursive ones. Such a kind of statement no longer holds in the presence of resource bounds. Contrary to what intuition might ... -
Computational power of neural networks: a Kolmogorov complexity characterization
Balcázar Navarro, José Luis; Gavaldà Mestre, Ricard; Siegelmann, H. (1993-01-01)
Report de recerca
Accés obertThe computational power of neural networks depends on properties of the real numbers used as weights. We focus on networks restricted to compute in polynomial time, operating on boolean inputs. Previous work has demonstrated ... -
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 obertWe 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 ... -
De cómo ciertos conjuntos no pueden ser NP-completos
Balcázar Navarro, José Luis (Universitat Politècnica de Barcelona. Centre de Càlcul, 1982-09)
Article
Accés obertEn este artículo se presenta una visión general a los últimos resultados acontecidos en el área de la estructura de la clase NP-completa y su relación con el problema de si: P=NP o P diferente de NP. -
Deciding bisimilarity is P-complete
Balcázar Navarro, José Luis; Gabarró Vallès, Joaquim; Santha, Miklos (1990)
Report de recerca
Accés obertOn finite labelled transition systems, the problems of deciding strong bisimilarity, observation equivalence, and observation congruence are P-complete under many-one NC-reducibility. As a consequence, algorithms for ... -
Deriving specifications of embeddings in recursive program design
Roselló Balanyà, Celestí; Balcázar Navarro, José Luis; Peña Marí, Ricardo (1989)
Report de recerca
Accés obertThe design of recursive functions is a well-studied subject. Design methods require a specification to start with, however, when an embedding design is attempted at, it is not clear how the specification of the embedding ... -
Diameter minimization in networks for SIMD machines
Beivide Palacio, Ramon; Balcázar Navarro, José Luis (1985)
Report de recerca
Accés obertWe propose an algebraic constructive method which allows to find a certain kind of networks having optimal diameter. These interconnection networks have been proposed for SIMD machines. We compare the results with other ...