Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jorge Calera-Rubio

dblp:97/4274 · DBLP profile ↗
← Back
9ranked-venue papers
1as first author
0since 2021 · last 2018
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 6Graphics, computer vision, multimedia, augmented reality and games · 2Theory of computation · 2 · 1 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Automata and formal languages · 100%
Artificial intelligence
1 paper
Information extraction and text analysis · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Automata and formal languages
grammatical inference
0.112005
Parsing with Probabilistic Strictly Locally Testable Tree Languages · IEEE Trans. Pattern Anal. Mach. Intell. 2005
Automata and formal languages › probabilistic automata
probabilistic finite-state automata
0.112005
Parsing with Probabilistic Strictly Locally Testable Tree Languages · IEEE Trans. Pattern Anal. Mach. Intell. 2005
Automata and formal languages › grammatical inference
probabilistic grammar learning
0.112005
Parsing with Probabilistic Strictly Locally Testable Tree Languages · IEEE Trans. Pattern Anal. Mach. Intell. 2005
Automata and formal languages › tree automata
probabilistic tree automata
0.112005
Parsing with Probabilistic Strictly Locally Testable Tree Languages · IEEE Trans. Pattern Anal. Mach. Intell. 2005
Natural language and speech › Information extraction and text analysis
syntactic parsing
0.012005
Parsing with Probabilistic Strictly Locally Testable Tree Languages · IEEE Trans. Pattern Anal. Mach. Intell. 2005

Methods — techniques the papers use, named apart from their topics

smoothing · 0.1maximum likelihood estimation · 0.1
YearPublicationVenuePosition
2018 Grammatical inference of directed acyclic graph languages with polynomial time complexity
Antonio Javier Gallego 0001, Damián López, Jorge Calera-Rubio
J. Comput. Syst. Sci.3
2009 Improving edge detection in highly noised sheet-metal images
abstract
This article proposes a new method for robust and accurate detection of the orientation and the location of an object on low-contrast surfaces in an industrial context. To be more efficient and effective, our method employs only artificial vision. Therefore, productivity is increased since it avoids the use of additional mechanical devices to ensure the accuracy of the system. The technical core is the treatment of straight line contours that occur in close neighbourhood to each other and with similar orientations. It is a particular problem in stacks of objects but can also occur in other applications. New techniques are introduced to ensure the robustness of the system and to tackle the problem of noise, such as an auto-threshold segmentation process, a new type of histogram and a robust regression method used to compute the result with a higher precision.
Antonio Javier Gallego 0001, Jorge Calera-Rubio
WACV2
2005 Parsing with Probabilistic Strictly Locally Testable Tree Languages
abstract
Probabilistic k-testable models (usually known as k-gram models in the case of strings) can be easily identified from samples and allow for smoothing techniques to deal with unseen events during pattern classification. In this paper, 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.
Jose L. Verdú-Mas, Rafael C. Carrasco, Jorge Calera-Rubio
IEEE Trans. Pattern Anal. Mach. Intell.3
2005 Smoothing and compression with stochastic k-testable tree languages
Juan Ramón Rico-Juan, Jorge Calera-Rubio, Rafael C. Carrasco
Pattern Recognit.2
2003 Learning probabilistic context-free grammars from treebanks
Jose L. Verdú-Mas, Jorge Calera-Rubio, Rafael C. Carrasco
CIARP2
2001 Online Symbolic-Sequence Prediction with Discrete-Time Recurrent Neural Networks
Juan Antonio Pérez-Ortiz, Jorge Calera-Rubio, Mikel L. Forcada
ICANN2
2001 Stochastic Inference of Regular Tree Languages
Rafael C. Carrasco, José Oncina, Jorge Calera-Rubio
Mach. Learn.3
2001 Online Text Prediction with Recurrent Neural Networks
Juan Antonio Pérez-Ortiz, Jorge Calera-Rubio, Mikel L. Forcada
Neural Process. Lett.2
1998 Computing the Relative Entropy Between Regular Tree Languages
Jorge Calera-Rubio, Rafael C. Carrasco
Inf. Process. Lett.1