Publicaciones

1

K. B. Athreya, J. M. Hitchcock, J. H. Lutz, and E. Mayordomo.
Effective strong dimension in algorithmic information and computational complexity.
In Proceedings of the Twenty-First Symposium on Theoretical Aspects of Computer Science, volume 2996 of Lecture Notes in Computer Science, pages 632-643. Springer-Verlag, 2004.

2

A. Atserias and V. Dalmau.
A combinatorial characterization of resolution width.
In Proceedings of the 18th IEEE Conference on Computational Complexity, 2003.

3

M. Baena.
Prospección de datos: Estudios de diversas técnicas y su aplicación a datos sobre incapacidad. Proyecto fin de carrera.
Technical report, ETSI Informática, 2003.

4

M. Baena, R. Morales, S. Cabuchola, and I. Santos.
Prospección de datos sanitarios: Estudio de la incapacidad permanente.
In Inforsalud 2004, pages 127-130, Madrid, 2004.

5

J. Baixeries and G. Casas-Garriga.
Sampling strategies for finding frequent sets.
In Actes des Journées Francophones d’Extraction et Gestion des Conaissances, pages 159-170, 2003.

6

J. Baixeries and G. Casas-Garriga.
Sampling strategies for finding frequent sets.
Revue des sciences et technologies de l'information (RTSI) Serie RIA-ECA, 17(1-2-3), 2003.

7

J.L. Balcázar and J. Baixeries.
Discrete deterministic data mining as knowledge compilation.
In Workshop on Discrete Mathematics and Data Mining in SIAM Int. Conf., 2003.

8

J.L. Balcázar and J. Baixeries.
Characterizations of multilevel dependencias and related expressions.
In Internacional Conference on Discovery Science, 2004.

9

J.L. Balcázar and G. Casas-Garriga.
On horn axiomatizations for sequential data.
In Internacional Conference in Database Theory, 2005.
accepted.

10

J.L. Balcázar, Y. Dai, and O. Watanabe.
Provably fast training algorithms for support vector machines.
Journal submission including the results from the three conference and workshop publications by the same authors.

11

A. Bulatov, H. Chen, and V. Dalmau.
Learnability of relatively quantified generalized formulas.
In Proceedings of the 15th International Conference on Algorithmic Learning Theory (ALT'04), 2004.

12

A.A. Bulatov and V. Dalmau.
Towards a dichotomy theorem for the counting constraint satisfaction problem.
In Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), pages 562-573, 2003.

13

S. Cabuchola.
Análisis de las patologías causantes de discapacidad laboral permanente mediante la aplicación de técnicas de inteligencia artificial y prospección de datos.
PhD thesis, Dept. de anatomía y medicina legal, Facultad de Medicina, Universidad de Málaga, 2003.
Advisors Ignacio Miguel Santos Amaya and Rafael Morales Bueno.

14

G. Casas-Garriga.
Discovering unbounded episodes in sequential data.
In 7th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD'03), Cavtat-Dubvrovnik, Croatia, 2003.

15

G. Casas-Garriga.
Towards a formal framework for mining general patterns from structured data.
In Int. Workshop on Multirelational Datamining (MRDM 03) in KDD 03 Int. Conf., Washington, USA, 2003.

16

G. Casas-Garriga and J.L. Balcázar.
Coproduct transformations on lattices of closed partial orders.
In International Conference on Graph Transformation, 2004.

17

H. Chen and V. Dalmau.
Looking algebraically at tractable quantified boolean formulas.
In Proceedings of the Seventh International Conference on Theory and Applications of Satisfiability Testing (SAT'04), Lecture Notes in Computer Science. Springer-Verlag, 2004.

18

H. Chen and V. Dalmau.
"Smart" look-ahead arc consistency and the pursuit of CSP tractability.
In Proceedings of the 10th International Conference on Principles and Practice of Constraint Programming (CP 2004), 2004.

19

J. J. Dai, J. I. Lathrop, J. H. Lutz, and E. Mayordomo.
Finite-state dimension.
Theoretical Computer Science, 310:1-33, 2004.

20

V. Dalmau and D. Ford.
Generalized satisfiability with k occurrences per variable: a study through delta-matroid parity.
In Proceedings of the 28th International Symposium on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science. Springer-Verlag, 2003.

21

V. Dalmau, A. Krokhin, and B. Larose.
First-order definable retraction problems for posets and reflexive graphs.
In Proceedings of the 19th IEEE Symposium on Logic in Computer Science (LICS 2004), 2004.

22

M. Fadda.
Non-associativity and balanced proof nets.
In Proceedings of Categorial Grammars, pages 46-58, Montpellier, 2004.

23

M. Fadda and G. Morrill.
The lambek calculus with brackets.
In P. Scott, C. Casadio, and R. Seely, editors, Language and Grammar: Studies in Mathematical Linguistics and Natural Language. CSLI, 2004.
In press.

24

R. Fidalgo.
Herramienta para la construcción de árboles de decisión. Proyecto fin de carrera.
Technical report, ETSI Informática, 2003.

25

I. Fortes, J.L. Balcázar, and R. Morales.
Bounding negative information in frequent sets algorithms.
In 4th International Conference DS 2001, Lecture Notes in Artificial Intelligence, pages 50-58, 2001.

26

J. M. Hitchcock, J. H. Lutz, and E. Mayordomo.
Scaled dimension and nonuniform complexity.
Journal of Computer and System Sciences, 69:97-122, 2004.

27

J.M. Hitchcock, M. López-Valdés, and E. Mayordomo.
Scaled dimension and the Kolmogorov complexity of Turing-hard sets.
In Proceedings of the 29th International Symposium on Mathematical Foundations of Computer Science, volume 3153 of Lecture Notes in Computer Science, pages 476-487. Springer-Verlag, 2004.

28

J. Jerez, J.A. Gómez-Ruiz, G. Ramos, J. Múñoz, and E. Alba-Conejo.
A combined neural network and decision trees model for prognosis of breast cancer relapse.
Artificial Intelligence in Medicine, 27:45-63, 2003.

29

A. Lozano and G. Valiente.
On the maximum common embedded subtree problem for ordered trees.
In C. Iliopoulos and T. Lecroq, editors, String Algorithmics, pages 155-169. King's College London Publications, 2004.
In press.

30

L. Mora, R. Ruiz, and R. Morales.
Modelo para la selección automática de componentes significativas en el análisis de series temporales.
In Caepia'03, 2003.

31

L. Mora-Lopez, R. Morales, M. Sidrach de Cardona, and F. Triguero.
Probabilistic finite automata and randomness in nature: a new approach in the modelling and prediction of climatic parameters.
In International Environmental Modelling and Software Congress, pages 78-83, Lugano, Suiza, 2002.

32

G. Morrill.
On anaphora in type logical grammar.
In G.-J. Kruiff and R.T. Oehrle, editors, Resource Sensitivity and Binding. Kluwer Academic Publishers, Dordrecht.
To appear.

33

G. Morrill.
Geometry of language and linguistic circuitry.
In P. Scott, C. Casadio, and R. Seely, editors, Language and Grammar: Studies in Mathematical Linguistics and Natural Language. CSLI, 2004.
In press.

34

G. Morrill and A. Gavarró.
On aphasic comprehension and working memory load.
In Proceedings of Categorial Grammars, pages 259-287, Montpellier, 2004.

35

M. Núñez and R. Fidalgo.
Aprendizaje de árboles de decisión temporales a partir de eventos.
Technical Report ITI-2003-01, Departamento de Lenguajes y Ciencias de la Computación, Universidad de Málaga, 2003.

36

M. Núñez, R. Fidalgo, and R. Morales.
Discovering temporal patterns from events and other multivariate data.
In Proceedings of the Congress Euro Electromagnetics (EUROEM 2004), Magdeburg (Germany), 2004.

37

M. Núñez, R. Fidalgo, and R. Morales.
Reducing potential risks by preventing events: A case study.
In Proceedings of the IFAC Congress on Management and Control of Production and Logistics (MCPL-2004), Oxford, UK, 2004.

38

M. Núñez and R. Morales.
Learning prediction knowledge for nonlinear systems.
Technical Report ITI-02-4, Departamento de Lenguajes y Ciencias de la Computación, Universidad de Málaga, 2002.

39

M. Núñez and R. Morales.
Incorporating prediction facilities to autonomous systems.
In Autonomous Agents & Multi Agent Systems. IEEE Computer Society Press, 2004.

40

M. Núñez, R. Morales, and F. Triguero.
Automatic discovery of rules for predicting network management events.
IEEE Journal on Selected Areas in Communications, 20(4), 2002.
Special Issue: Recent Advances in Fundamentals of Network Management.