Exploració per autor "Balcázar Navarro, José Luis"
Ara es mostren els items 47-66 de 79
-
Learnability of Kolmogorov-easy circuit expressions via queries
(1995-02)
Report de recerca
Accés obertCircuit expressions were introduced to provide a natural link between Computational Learning and certain aspects of Structural Complexity. Upper and lower bounds on the learnability of circuit expressions are known. We ... -
Learning definite Horn formulas from closure queries
(2017-01-07)
Article
Accés obertA definite Horn theory is a set of n-dimensional Boolean vectors whose characteristic function is expressible as a definite Horn formula, that is, as conjunction of definite Horn clauses. The class of definite Horn theories ... -
Logarithmic advice classes
(1988)
Report de recerca
Accés obertKarp and Lipton [9] introduced the notion of non-uniform complexity classes where a certain amount of "side information", the advice, is given for free. The advice only depends on the length of the input. Karp and Lipton ... -
Logspace self-reducibility
(Institute of Electrical and Electronics Engineers (IEEE), 1988)
Text en actes de congrés
Accés obertA definition of self-reducibility is proposed to deal with logarithmic space complexity classes. A general property derived from the definition is used to prove known results comparing uniform and nonuniform complexity ... -
Manual de POSTOFF : nueva versión
(1985)
Report de recerca
Accés obertUn programa adaptador de textos para que el formateador DSR Runoff se haga amiguete de la impresora LA100. Documentación correspondiente a la versión 3.0. Creado por José Luis Balcázar en la F.I.B. durante 1984. -
Mining educational data for patterns with negations and high confidence boost
(2010)
Text en actes de congrés
Accés restringit per política de l'editorialAssociation rules constitute a well-known and widely employed data mining technique. We study their applicability in Educational Data Mining. We develop a case study of datasets from that eld: logs of an e-learning ... -
Mining frequent closed rooted trees
(2010-01)
Article
Accés obertMany knowledge representation mechanisms are based on tree-like structures, thus symbolizing the fact that certain pieces of information are related in one sense or another. There exists a well-studied process of closure-based ... -
New Closure Operators and Lattice Representations for Multivalued Dependencies and Related Expressions
(2005)
Text en actes de congrés
Accés obertIn Database Theory, Multivalued Dependencies are the main tool to define the Fourth Normal Form and, as such, their inference problem has been deeply studied; two related notions appearing in that study are a syntactical ... -
Nonuniform complexity classes specified by lower and upper bounds
(1989-09)
Article
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 giue a new characterization of classes defined ... -
Objective novelty of association rules: measuring the confidence boost
(2010)
Comunicació de congrés
Accés obertOn sait bien que la confiance des régles d’association n’est pas vraiment satisfaisant comme mésure d’interêt. Nous proposons, au lieu de la substituer par des autres mésures (soit, en l’employant de façon conjointe a des ... -
On infinite sequences (almost) as easy as pi
(1994-04)
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 ... -
On some "non uniform" complexity measures
(1985)
Report de recerca
Accés obertNon-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 ... -
Only smart oracles help
(1988-09)
Report de recerca
Accés obertIt is shown that every set that is p-cheateble up to a logarithmic extent is a no-1-helper. -
Optimal distance networks of low degree for parallel computers
(1989)
Report de recerca
Accés obertWe introduce and study a family of interconnection schemes, the Midimew networks, based on circulant graphs of degree 4. A family of such circulants is determined and shown to be optimal with respect to two distance ... -
Parallel complexity in the design and analysis of concurrent systems
(1990-10)
Report de recerca
Accés obertWe study the parallel complexity of three problems on concurrency: decision of firing sequences for Petri nets, trace equivalence for partially commutative monoids, and strong bisimilarity in finite transition systems. We ... -
Quantitative redundancy in partial implications
(Springer, 2015)
Text en actes de congrés
Accés obertWe survey the different properties of an intuitive notion of redundancy, as a function of the precise semantics given to the notion of partial implication. -
Refining logical characterizations of advice complexity classes
(1997-05)
Report de recerca
Accés obertNumerical relations in logics are known to characterize, via the finite models of their sentences, polynomial advice nonuniform complexity classes. These are known to coincide with reduction classes of tally sets. ... -
Relative entailment among probabilistic implications
(2019-02-06)
Article
Accés obertWe study a natural variant of the implicational fragment of propositional logic. Its formulas are pairs of conjunctions of positive literals, related together by an implicational-like connective; the semantics of this sort ... -
Self-reducibility
(1988-11)
Report de recerca
Accés obertNew self-reducibility structures are proposed to deal with sets outside the class PSPACE and with sets in logarithmic space complexity classes. General properties derived from the definition are used to prove known results ... -
Self-reducibility structures and solutions of NP problems
(1988)
Report de recerca
Accés obertUsing polynomial time self-reducibility structures, we characterize certain "helping" notions, show how the characterization provides the main tool for the proof of known relationships between decisional and functional ...
