articles.bib
@ARTICLE{pami:Vidal+Thollard+delaHiguera+Casacuberta+Carrasco:2004,
AUTHOR = {E. Vidal and F. Thollard and C. de la Higuera and and
F. Casacuberta and R. C. Carrasco},
TITLE = {Probabilistic Finite-State Machines -- {Part I}},
JOURNAL = {IEEE Trans. on Pattern analysis and Machine Intelligence},
YEAR = {2005},
VOLUME = {27},
NUMBER = {7},
PAGES = {1013--1025},
ABSTRACT = { In part I of this paper we survey probabilistic
finite-state machines as generative objects and study their
definitions and properties. },
PDF = {http://www.dlsi.ua.es/~carrasco/papers/pami04_1.pdf}
}
@ARTICLE{pami:Vidal+Thollard+delaHiguera+Casacuberta+Carrasco:2004b,
AUTHOR = {E. Vidal and F. Thollard and C. de la Higuera and and
F. Casacuberta and R. C. Carrasco},
TITLE = {Probabilistic Finite-State Machines -- {Part II}},
JOURNAL = {IEEE Trans. on Pattern analysis and Machine Intelligence},
YEAR = {2005},
VOLUME = {27},
NUMBER = {7},
PAGES = {1026--1039},
ABSTRACT = { In part II, we study the
relation of probabilistic finite-state automata with other
well known devices that generate strings as hidden Markov
models and $n$-grams, and provide theorems, algorithms and
properties that represent a current state of the art of
these objects. },
PDF = {http://www.dlsi.ua.es/~carrasco/papers/pami04_2.pdf}
}
@ARTICLE{pami:Verdu+carrasco+Calera:2004c,
TITLE = {Parsing with probabilistic strictly locally testable tree
languages},
AUTHOR = {Jose Luis Verd\'{u}-Mas and Rafael C. Carrasco and Jorge
Calera-Rubio},
JOURNAL = {IEEE Trans. on Pattern analysis and Machine Intelligence},
YEAR = {2005},
VOLUME = {27},
NUMBER = {7},
PAGES = {1040--1050},
NUMBER = {to appear},
ABSTRACT = {We introduce the family of stochastic $k$-testable tree
languages and describe how these models can approximate any
stochastic rational tree language. The model is applied to
the task of learning a probabilistic $k$-testable model from
a sample of parsed sentences. In particular, a parser for a
natural language grammar that incorporates smoothing is
shown.},
PDF = {http://www.dlsi.ua.es/~carrasco/papers/pami04_3.pdf}
}
@ARTICLE{pr:Rico+Rubio+Carrasco:2004,
AUTHOR = {Juan Ram\'{o}n Rico-Juan and Jorge Calera-Rubio and Rafael
C. Carrasco},
TITLE = {Smoothing and Compression with Stochastic $k$-testable Tree
Languages},
JOURNAL = {Pattern Recognition},
VOLUME = {38},
NUMBER = {9},
PAGES = {1420--1430},
YEAR = {2005},
PDF = {http://www.dlsi.ua.es/~carrasco/papers/pr04.pdf},
ABSTRACT = {In this paper, we describe some techniques to learn
probabilistic $k$-testable tree models, a generalization of
the well known $k$-gram models, that can be used to compress
or classify structured data.}
}
@ARTICLE{pr:Carrasco+Rico:2002,
AUTHOR = {Rafael C. Carrasco and Juan Ramón Rico-Juan},
TITLE = {A similarity between probabilistic tree languages:
application to {XML} document families},
JOURNAL = {Pattern Recognition},
YEAR = 2003,
VOLUME = 36,
NUMBER = 9,
PAGES = {2197--2199},
PDF = {http://www.dlsi.ua.es/~carrasco/papers/pr02.pdf},
ABSTRACT = {We describe a general approach to compute a similarity
measure between distributions generated by probabilistic
tree automata. We show how this similarity
can be computed for families of structured (XML) documents.}
}
@ARTICLE{cl:Carrasco+Forcada:2002,
AUTHOR = {Rafael C. Carrasco and Mikel L. Forcada},
TITLE = {Incremental construction and maintenance of minimal
finite-state automata},
JOURNAL = {Computational Linguistics},
VOLUME = {28},
NUMBER = {2},
YEAR = {2002},
PAGES = {207--216},
PDF = {http://www.dlsi.ua.es/~carrasco/papers/cl01.pdf},
ABSTRACT = {We describe a simple and efficient method to modify any
minimal finite-state automaton (acyclic or not) so that a
string is added to or removed from the language accepted by
it; both operations solve the dictionary construction
problem addressed by Daciuk et al. as a special case.}
}
@ARTICLE{ml:Carrasco+Oncina+Calera:2001,
AUTHOR = {Rafael C. Carrasco and Jose Oncina and Jorge
Calera-Rubio},
TITLE = {Stochastic inference of regular tree languages},
JOURNAL = {Machine Learning},
YEAR = {2001},
VOLUME = {44},
NUMBER = {1/2},
PAGES = {185--197},
PDF = {http://www.dlsi.ua.es/~carrasco/papers/ml99.pdf},
ABSTRACT = {We generalize a former algorithm for regular
language identification from stochastic samples to
the case of tree languages. The algorithm is used to
identify context-free languages when structural
information about the strings is available.}
}
@ARTICLE{ieeeTKDE:Carrasco+Forcada:2000,
AUTHOR = {Rafael C. Carrasco and Mikel L. Forcada},
TITLE = {Simple strategies to encode tree automata in sigmoid
tree-walking neural networks},
JOURNAL = {IEEE Transactions on Knowledge and Data Engineering},
VOLUME = {13},
NUMBER = {2},
PAGES = {148-156},
YEAR = {2001},
PDF = {http://www.dlsi.ua.es/~carrasco/papers/TKDE99.pdf},
ABSTRACT = { In this paper, we explore the simulation of deterministic
finite-state tree automata DFSTA in sigmoid tree-walking
neural nets TWNN (that is, analog TWNN using monotonously
growing transfer functions), and also present an alternative
scheme for one-hot encoding of the input that yields smaller
weight values and therefore works at a lower saturation
level.}
}
@ARTICLE{nc:Carrasco+Forcada:1999,
AUTHOR = {Rafael C. Carrasco and Mikel L. Forcada and M. \'{A}ngeles
Vald\'{e}s-Mu\~{n}oz and Ram\'{o}n P. Ñeco},
TITLE = {Stable encoding of finite-state machines in discrete-time
recurrent neural nets with sigmoid units},
JOURNAL = {Neural Computation},
VOLUME = {12},
NUMBER = {9},
PAGES = {2129--2174},
YEAR = {2000},
POSTSCRIPT = {http://www.dlsi.ua.es/~carrasco/papers/nc99.ps.gz},
ABSTRACT = { Unlike previous work that either imposed some restrictions
to state values, or used a detailed analysis based on
fixed-point attractors, we present an approach which applies
to any positive, bounded, strictly growing, continuous
activation function, and uses simple bounding criteria based
on a study of the conditions under which a proposed encoding
scheme guarantees that the DTRNN is actually behaving as a
finite-state machine.}
}
@ARTICLE{rairo:Carrasco+Oncina:1999,
AUTHOR = {Rafael C. Carrasco and Jose Oncina},
JOURNAL = {RAIRO (Theoretical Informatics and Applications)},
TITLE = {Learning deterministic regular grammars from stochastic
samples in polynomial time},
VOLUME = {33},
NUMBER = {1},
YEAR = {1999},
PAGES = {1--20},
PDF = {http://www.dlsi.ua.es/~carrasco/papers/RAIRO99.pdf},
ABSTRACT = { We propose a class of algorithms for the identification of
stochastic regular languages which allow for the
identification of the structure of the minimal stochastic
automaton generating the language. It is shown that the time
needed grows only linearly with the size of the sample set.}
}
@ARTICLE{ipl:Calera-Rubio+Carrasco:1998,
TITLE = {Computing the relative entropy between regular tree
languages},
AUTHOR = {Jorge Calera-Rubio and Rafael C. Carrasco},
PAGES = {283--289},
JOURNAL = {Information Processing Letters},
YEAR = {1998},
VOLUME = {68},
NUMBER = {6},
POSTSCRIPT = {http://www.dlsi.ua.es/~carrasco/papers/ipl98.ps.gz},
ABSTRACT = { Grammatical inference methods are often checked with
training samples generated by a known grammar which is later
compared to the grammar inferred from the sample. We
describe an efficient procedure to compute the relative
entropy between two stochastic deterministic regular tree
grammars.}
}
@ARTICLE{rairo:Carrasco:1997,
AUTHOR = {Rafael C. Carrasco},
JOURNAL = {RAIRO (Theoretical Informatics and Applications)},
TITLE = {Accurate computation of the relative entropy between
stochastic regular grammars},
VOLUME = {31},
NUMBER = {5},
YEAR = {1997},
PAGES = {437--444},
PDF = {http://www.dlsi.ua.es/~carrasco/papers/RAIRO97.pdf},
ABSTRACT = { Usually, grammatical inference methods use large test sets
generated with the true distribution to evaluate the
relative entropy between the model and the true gramamr. In
this paper, an iterative procedure to compute the relative
entropy between two stochastic deterministic regular
grammars is proposed.}
}
@ARTICLE{prl:Mico+Oncina+Carrasco:1996,
AUTHOR = {Luisa Mic\'{o} and Jose Oncina and Rafael C. Carrasco},
JOURNAL = {Pattern Recognition Letters},
TITLE = {A fast branch and bound nearest neighbour classifier
in metric spaces},
VOLUME = {17},
NUMBER = {5},
YEAR = {1996},
PAGES = {731--739},
ABSTRACT = {The recently introduced algorithm LAESA finds the
nearest neighbour prototype in a metric space. The
average number of distances computed in the
algorithm does not depend on the number of
prototypes but it shows linear space and time
complexities. In this paper, a new algorithm
(TLAESA) is proposed which has a sublinear time
complexity and keeps the other features unchanged.}
}
@ARTICLE{nc:Forcada+Carrasco:1995,
AUTHOR = {Mikel L. Forcada and Rafael C. Carrasco},
TITLE = {Learning the Initial State of a Second-Order Recurrent
Neural Network during Regular-Language Inference},
TYPE = {Letter},
JOURNAL = {Neural Computation},
VOLUME = {7},
NUMBER = {5},
PAGES = {923--930},
YEAR = {1995},
POSTSCRIPT = {http://www.dlsi.ua.es/~carrasco/papers/nc95.ps.gz},
ABSTRACT = { A modified version of the real-time recurrent learning
(RTRL) algorithm used to train 2ORNNs, than learns the
initial state in addition to the weights improves the
learning of regular languages when the size of the network
is small.}
}
@ARTICLE{prl:Carrasco+Forcada:1995,
AUTHOR = {Rafael C. Carrasco and Mikel L. Forcada},
JOURNAL = {Pattern Recognition Letters},
TITLE = {A note on the {Nagendraprasad-Wang-Gupta} thinning
algorithm},
VOLUME = {16},
NUMBER = {5},
YEAR = {1995},
PAGES = {539--541},
PDF = {http://www.dlsi.ua.es/~carrasco/papers/prl95.pdf},
ABSTRACT = {A symmetrized version of the Nagendraprasad-Wang-Gupta
thinning algorithm produces simpler and more elegant
skeletons of handwritten characters at zero extra
computational cost.}
}
@ARTICLE{Carrasco:1994a,
AUTHOR = {R. C. Carrasco},
TITLE = {Nuclear {Compton} scattering in the delta resonance region},
JOURNAL = {Anales de Física},
VOLUME = {90},
YEAR = {1994},
PAGES = {8-16},
ABSTRACT = {The resonant amplitude and the imaginary part of the Compton
amplitude are calculated using microscopic many body
methods. The real part of the background is computed using
dispersion relations.}
}
@ARTICLE{Carrasco:1994b,
AUTHOR = {R. C. Carrasco and M. J. Vicente Vacas and E. Oset},
TITLE = {Inclusive (gamma, N), (gamma, N N) and (gamma, N pi)
reactions in nuclei at intermediate-energies},
JOURNAL = {Nucl. Phys.},
VOLUME = {A570},
YEAR = {1994},
PAGES = {701-721},
ABSTRACT = {Differential cross sections of nucleons excited in
photonuclear reactions are studied by considering all
relevant reaction mechanisms. Also cross sections for
nucleon emission in coincidence with one pion are
calculated.}
}
@ARTICLE{Carrasco:1993a,
AUTHOR = {R. C. Carrasco},
TITLE = {Inclusive eta photoproduction in nuclei},
JOURNAL = {Phys. Rev.},
VOLUME = {C48},
YEAR = {1993},
PAGES = {2333-2339},
ABSTRACT = {A local model for the nuclear modifications to the
photoproduction of eta mesons through the N*(1535) resonance
predicts that the cross section for different nuclei behaves
like $A^\alpha$ whith alpha approximately 0.6}
}
@ARTICLE{Nieves:1993,
AUTHOR = {J. Nieves and E. Oset and R. C. Carrasco},
TITLE = {Deeply bound pionic atoms with resonant Compton scattering},
JOURNAL = {Nucl. Phys.},
VOLUME = {A565},
YEAR = {1993},
PAGES = {785-796},
ABSTRACT = {We study the contribution to the Compton nuclear scattering
of the resonant channel (A'pi-) when a negative charge pion
is bound in the nucleus}
}
@ARTICLE{Carrasco:1993b,
AUTHOR = {R. C. Carrasco and J.M. Nieves and E. Oset},
TITLE = {Coherent (gamma, pi0) photoproduction in a local
approximation to the {Delta-hole} model},
JOURNAL = {Nucl. Phys.},
VOLUME = {A565},
YEAR = {1993},
PAGES = {797-817},
ABSTRACT = {We develop a local approximation to the Delta-hole model for
coherent pi0 photoproduction and apply it to the calculation
of cross sections in heavy nuclei, where traditional
approaches are unfeasible}
}
@ARTICLE{Carrasco:1992a,
AUTHOR = {R. C. Carrasco and L.L. Salcedo and E. Oset},
TITLE = {Inclusive (gamma, pi) reactions in nuclei},
JOURNAL = {Nucl. Phys.},
VOLUME = {A541},
YEAR = {1992},
PAGES = {585-622},
ABSTRACT = {Double differential cross sections for inclusive (gamma,pi)
reactions in nuclei are computed using a microscopic
approach based on local models and many body quantum
theory. All relevant mechanism and final state interactions
are taken into account.}
}
@ARTICLE{Carrasco:1992b,
AUTHOR = {R. C. Carrasco and E. Oset},
TITLE = {Interaction of real photons with nuclei from {100-MEV} to
500-{MEV}},
JOURNAL = {Nucl. Phys.},
VOLUME = {A536},
YEAR = {1992},
PAGES = {445-588},
ABSTRACT = {A systematic many body expansion in the number of
particle-hole excitations is developed. We use effective
model for the basic interactions and local models to take
into account the nuclear medium effect.}
}
@ARTICLE{Carrasco:1992c,
AUTHOR = {R. C. Carrasco and E. Oset},
TITLE = {Enhancement of the nuclear dipole sum rule: a microscopic
approach},
JOURNAL = {Phys. Rev.},
VOLUME = {C45},
YEAR = {1992},
PAGES = {764-770},
ABSTRACT = {The use of local models to study the nuclear dipole sum rule
allows one to separate different contributions o this
magnitude. This provides us with a deeper insight of this
sum rule.}
}
@ARTICLE{Chiang:1990,
AUTHOR = {H. C. Chiang and E. Oset and R. C. Carrasco and J. M. Nieves
and J. Navarro},
TITLE = {Inclusive radiative pion capture in nuclei},
JOURNAL = {Nucl. Phys.},
VOLUME = {A510},
YEAR = {1990},
PAGES = {573-590},
ABSTRACT = {The problem of inclusive radiative pion capture in nuclei is
reanalyzed from a many body point of view.}
}