Arlindo L. Oliveira

Orcid: 0000-0001-8638-5594

Affiliations:
  • Instituto Superior Técnico, Lisbon, Portugal


According to our database1, Arlindo L. Oliveira authored at least 128 papers between 1991 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Explicitly Modeling Pre-Cortical Vision with a Neuro-Inspired Front-End Improves CNN Robustness.
CoRR, 2024

LumberChunker: Long-Form Narrative Document Segmentation.
CoRR, 2024

QUBIQ: Uncertainty Quantification for Biomedical Image Segmentation Challenge.
CoRR, 2024

Finding Regions of Interest in Whole Slide Images Using Multiple Instance Learning.
CoRR, 2024

DE-COP: Detecting Copyrighted Content in Language Models Training Data.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

Contribution of V1 Receptive Field Properties to Corruption Robustness in CNNs.
Proceedings of the ECAI 2024 - 27th European Conference on Artificial Intelligence, 19-24 October 2024, Santiago de Compostela, Spain, 2024

2023
DeepThought: An Architecture for Autonomous Self-motivated Systems.
CoRR, 2023

Matching the Neuronal Representations of V1 is Necessary to Improve Robustness in CNNs with V1-like Front-ends.
CoRR, 2023

Connecting metrics for shape-texture knowledge in computer vision.
CoRR, 2023

Augmentation-Based Approaches for Overcoming Low Visibility in Street Object Detection.
Proceedings of the International Conference on Machine Learning and Applications, 2023

Improving Embeddings for High-Accuracy Transformer-Based Address Matching Using a Multiple in-Batch Negatives Loss.
Proceedings of the International Conference on Machine Learning and Applications, 2023

Improving Address Matching Using Siamese Transformer Networks.
Proceedings of the Progress in Artificial Intelligence, 2023

Pretraining the Vision Transformer Using Self-Supervised Methods for Vision Based Deep Reinforcement Learning.
Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023

2022
Modeling the Geospatial Evolution of COVID-19 using Spatio-temporal Convolutional Sequence-to-sequence Neural Networks.
ACM Trans. Spatial Algorithms Syst., 2022

Assessing the Impact of Attention and Self-Attention Mechanisms on the Classification of Skin Lesions.
Proceedings of the International Joint Conference on Neural Networks, 2022

Stenosis Detection in X-ray Coronary Angiography with Deep Neural Networks Leveraged by Attention Mechanisms.
Proceedings of the 9th International Conference on Bioinformatics Research and Applications, 2022

Using a Siamese Network to Accurately Detect Ischemic Stroke in Computed Tomography Scans.
Proceedings of the Progress in Artificial Intelligence, 2022

Assessing Policy, Loss and Planning Combinations in Reinforcement Learning Using a New Modular Architecture.
Proceedings of the Progress in Artificial Intelligence, 2022

2021
Modelling Neuronal Behaviour with Time Series Regression: Recurrent Neural Networks on C. Elegans Data.
CoRR, 2021

Modeling the geospatial evolution of COVID-19 using spatio-temporal convolutional sequence-to-sequence neural networks.
CoRR, 2021

Graph Neural Networks for Traffic Forecasting.
CoRR, 2021

Automated Detection of Coronary Artery Stenosis in X-ray Angiography using Deep Neural Networks.
CoRR, 2021

Combining Off and On-Policy Training in Model-Based Reinforcement Learning.
CoRR, 2021

Encoder-Decoder Architectures for Clinically Relevant Coronary Artery Segmentation.
Proceedings of the Computational Advances in Bio and Medical Sciences: 11th International Conference, 2021

Using Soft Labels to Model Uncertainty in Medical Image Segmentation.
Proceedings of the Brainlesion: Glioma, Multiple Sclerosis, Stroke and Traumatic Brain Injuries, 2021

2018
Using Machine Learning to Improve the Prediction of Functional Outcome in Ischemic Stroke Patients.
IEEE ACM Trans. Comput. Biol. Bioinform., 2018

Conditional Random Fields as Recurrent Neural Networks for 3D Medical Imaging Segmentation.
CoRR, 2018

Computer Architecture - Digital Circuits to Microprocessors
WorldScientific, ISBN: 9789813238350, 2018

2016
DegreeCox - a network-based regularization method for survival analysis.
BMC Bioinform., 2016

2014
The YEASTRACT database: an upgraded information system for the analysis of gene and genomic transcription regulation in <i>Saccharomyces cerevisiae</i>.
Nucleic Acids Res., 2014

2012
Mining query log graphs towards a query folksonomy.
Concurr. Comput. Pract. Exp., 2012

2011
Fully compressed suffix trees.
ACM Trans. Algorithms, 2011

YEASTRACT: providing a programmatic access to curated transcriptional regulatory associations in <i>Saccharomyces cerevisiae</i> through a web services interface.
Nucleic Acids Res., 2011

Discriminative Learning of Bayesian Networks via Factorized Conditional Log-Likelihood.
J. Mach. Learn. Res., 2011

Quantitative Modeling of the <i>Saccharomyces cerevisiae</i> Flr1 regulatory Network Using an S-System Formalism.
J. Bioinform. Comput. Biol., 2011

Efficient alignment of pyrosequencing reads for re-sequencing applications.
BMC Bioinform., 2011

TFRank: network-based prioritization of regulatory associations underlying transcriptional responses.
Bioinform., 2011

Haplotype inference with pseudo-Boolean optimization.
Ann. Oper. Res., 2011

GRISOTTO: A greedy approach to improve combinatorial algorithms for motif discovery with prior knowledge.
Algorithms Mol. Biol., 2011

Quantitative Modeling the Saccharomyces cerevisiae FLR1 Regulatory Network Using an S-System Formalism.
Proceedings of the 2011 IEEE International Conference on Healthcare Informatics, 2011

Sliding Window Update Using Suffix Arrays.
Proceedings of the 2011 Data Compression Conference (DCC 2011), 2011

2010
Identification of Regulatory Modules in Time Series Gene Expression Data Using a Linear Time Biclustering Algorithm.
IEEE ACM Trans. Comput. Biol. Bioinform., 2010

Haplotype Inference by Pure Parsimony: A Survey.
J. Comput. Biol., 2010

Mining Large Query Induced Graphs towards a Hierarchical Query Folksonomy.
Proceedings of the String Processing and Information Retrieval, 2010

Apt-pbo: solving the software dependency problem using pseudo-boolean optimization.
Proceedings of the ASE 2010, 2010

A Data Mining Approach for the Detection of High-Risk Breast Cancer Groups.
Proceedings of the Advances in Bioinformatics, 2010

Parallel and Distributed Compressed Indexes.
Proceedings of the Combinatorial Pattern Matching, 21st Annual Symposium, 2010

On Community Detection in Very Large Networks.
Proceedings of the Complex Networks - Second International Workshop, 2010

Fully Generalized Graph Cores.
Proceedings of the Complex Networks - Second International Workshop, 2010

Using graph modularity analysis to identify transcription factor binding sites.
Proceedings of the 2010 IEEE International Conference on Bioinformatics and Biomedicine Workshops, 2010

Efficient and Accurate Haplotype Inference by Combining Parsimony and Pedigree Information.
Proceedings of the Algebraic and Numeric Biology - 4th International Conference, 2010

2009
Constant Time Clash Detection in protein Folding.
J. Bioinform. Comput. Biol., 2009

Time and Memory Efficient Lempel-Ziv Compression Using Suffix Arrays
CoRR, 2009

A polynomial time biclustering algorithm for finding approximate expression patterns in gene expression time series.
Algorithms Mol. Biol., 2009

Approximate String Matching with Compressed Indexes.
Algorithms, 2009

Efficient Biclustering Algorithms for Time Series Gene Expression Data Analysis.
Proceedings of the Distributed Computing, 2009

On the Use of Suffix Arrays for Memory-Efficient Lempel-Ziv Data Compression.
Proceedings of the 2009 Data Compression Conference (DCC 2009), 2009

2008
YEASTRACT-DISCOVERER: new tools to improve the analysis of transcriptional regulatory associations in <i>Saccharomyces cerevisiae</i>.
Nucleic Acids Res., 2008

A compressed self-index using a Ziv-Lempel dictionary.
Inf. Retr., 2008

An analysis of the positional distribution of DNA motifs in promoter regions and its biological relevance.
BMC Bioinform., 2008

Using Grammatical Inference Techniques to Learn Ontologies that Describe the Structure of Domain Instances.
Appl. Artif. Intell., 2008

An Evaluation of the Impact of Side Chain Positioning on the Accuracy of Discrete Models of Protein Structures.
Proceedings of the Advances in Bioinformatics and Computational Biology, 2008

Indexed Hierarchical Approximate String Matching.
Proceedings of the String Processing and Information Retrieval, 2008

Clique Analysis of Query Log Graphs.
Proceedings of the String Processing and Information Retrieval, 2008

Suffix Arrays - A Competitive Choice for Fast Lempel-Ziv Compressions.
Proceedings of the SIGMAP 2008, 2008

Identification of Transcription Factor Binding Sites in Promoter Regions by Modularity Analysis of the Motif Co-occurrence Graph.
Proceedings of the Bioinformatics Research and Applications, 2008

Haplotype Inference with Boolean Constraint Solving: An Overview.
Proceedings of the 20th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2008), 2008

On the Suitability of Suffix Arrays for Lempel-Ziv Data Compression.
Proceedings of the e-Business and Telecommunications - International Conference, 2008

Ontology Design Principles and Normalization Techniques in the Web.
Proceedings of the Data Integration in the Life Sciences, 5th International Workshop, 2008

Dynamic Fully-Compressed Suffix Trees.
Proceedings of the Combinatorial Pattern Matching, 19th Annual Symposium, 2008

Efficient Haplotype Inference with Combined CP and OR Techniques.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2008

2007
Efficient generation of super condensed neighborhoods.
J. Discrete Algorithms, 2007

Approximate String Matching with Lempel-Ziv Compressed Indexes.
Proceedings of the String Processing and Information Retrieval, 2007

Semi-supervised single-label text categorization using centroid-based classifiers.
Proceedings of the 2007 ACM Symposium on Applied Computing (SAC), 2007

Learning bayesian networks consistent with the optimal branching.
Proceedings of the Sixth International Conference on Machine Learning and Applications, 2007

Efficient and Tight Upper Bounds for Haplotype Inference by Pure Parsimony Using Delayed Haplotype Selection.
Proceedings of the Progress in Artificial Intelligence, 2007

Efficient Learning of Bayesian Network Classifiers.
Proceedings of the AI 2007: Advances in Artificial Intelligence, 2007

An Efficient Biclustering Algorithm for Finding Genes with Similar Patterns in Time-series Expression Data.
Proceedings of 5th Asia-Pacific Bioinformatics Conference, 2007

Efficient Haplotype Inference with Pseudo-boolean Optimization.
Proceedings of the Algebraic Biology, Second International Conference, 2007

2006
An Efficient Algorithm for the Identification of Structured Motifs in DNA Promoter Sequences.
IEEE ACM Trans. Comput. Biol. Bioinform., 2006

The YEASTRACT database: a tool for the analysis of transcription regulatory associations in <i>Saccharomyces cerevisiae</i>.
Nucleic Acids Res., 2006

MUSA: a parameter free algorithm for the identification of biologically significant motifs.
Bioinform., 2006

Dotted Suffix Trees A Structure for Approximate Text Indexing.
Proceedings of the String Processing and Information Retrieval, 2006

DFT and Probabilistic Testability Analysis at RTL.
Proceedings of the Eleventh Annual IEEE International High-Level Design Validation and Test Workshop 2006, 2006

Probabilistic Testability Analysis and DFT Methods at RTL.
Proceedings of the 9th IEEE Workshop on Design & Diagnostics of Electronic Circuits & Systems (DDECS 2006), 2006

2005
Inference of regular languages using state merging algorithms with search.
Pattern Recognit., 2005

A Linear Time Biclustering Algorithm for Time Series Gene Expression Data.
Proceedings of the Algorithms in Bioinformatics, 5th International Workshop, 2005

Faster Generation of Super Condensed Neighbourhoods Using Finite Automata.
Proceedings of the String Processing and Information Retrieval, 2005

Using a More Powerful Teacher to Reduce the Number of Queries of the L* Algorithm in Practical Applications.
Proceedings of the Progress in Artificial Intelligence, 2005

An Efficient Algorithm for Generating Super Condensed Neighborhoods.
Proceedings of the Combinatorial Pattern Matching, 16th Annual Symposium, 2005

A highly scalable algorithm for the extraction of CIS-regulatory regions.
Proceedings of 3rd Asia-Pacific Bioinformatics Conference, 17-21 January 2005, Singapore, 2005

2004
Biclustering Algorithms for Biological Data Analysis: A Survey.
IEEE ACM Trans. Comput. Biol. Bioinform., 2004

Special issue on string processing and information retrieval.
J. Discrete Algorithms, 2004

Efficient Extraction of Structured Motifs Using Box-Links.
Proceedings of the String Processing and Information Retrieval, 2004

A parallel algorithm for the extraction of structured motifs.
Proceedings of the 2004 ACM Symposium on Applied Computing (SAC), 2004

Constraint Relaxations for Discovering Unknown Sequential Patterns.
Proceedings of the KDID 2004, 2004

A New Quick Point Location Algorithm.
Proceedings of the Conceptual Modeling for Advanced Application Domains, 2004

A Probabilistic Method for the Computation of Testability of RTL Constructs.
Proceedings of the 2004 Design, 2004

2003
On the problem of gate assignment under different rise and fall delays.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2003

An Empirical Comparison of Text Categorization Methods.
Proceedings of the String Processing and Information Retrieval, 2003

Metrics for Grid Applicability: A Distributed Elliptic Curve Platform Assessment.
Proceedings of the Parallel Processing and Applied Mathematics, 2003

Generalization of Pattern-Growth Methods for Sequential Pattern Mining with Gap Constraints.
Proceedings of the Machine Learning and Data Mining in Pattern Recognition, 2003

Analog Macromodeling using Kernel Methods.
Proceedings of the 2003 International Conference on Computer-Aided Design, 2003

A Data Mining Approach to Credit Risk Evaluation and Behaviour Scoring.
Proceedings of the Progress in Artificial Intelligence, 2003

Implicit Resolution of the Chapman-Kolmogorov Equations for Sequential Circuits: An Application in Power Estimation.
Proceedings of the 2003 Design, 2003

2002
Implicit FSM decomposition applied to low-power design.
IEEE Trans. Very Large Scale Integr. Syst., 2002

Inference of Sequential Association Rules Guided by Context-Free Grammars.
Proceedings of the Grammatical Inference: Algorithms and Applications, 2002

2001
Techniques for the creation of digital watermarks in sequentialcircuit designs.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2001

Efficient Algorithms for the Inference of Minimum Size DFAs.
Mach. Learn., 2001

Circuit partitioning techniques for power estimation using the full set of input correlations.
Proceedings of the 2001 8th IEEE International Conference on Electronics, 2001

2000
An Exact Gate Assignment Algorithm for Tree Circuits Under Rise and Fall Delays.
Proceedings of the 2000 IEEE/ACM International Conference on Computer-Aided Design, 2000

FSM decomposition by direct circuit manipulation applied to low power design.
Proceedings of ASP-DAC 2000, 2000

1999
A new algorithm for exact reduction of incompletely specified finite state machines.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1999

Integrating Dynamic Power Management in the Design Flow.
Proceedings of the VLSI: Systems on a Chip, 1999

Robust Techniques for Watermarking Sequential Circuit Designs.
Proceedings of the 36th Conference on Design Automation, 1999

1998
Exact Minimization of Binary Decision Diagrams Using Implicit Techniques.
IEEE Trans. Computers, 1998

Efficient Search Techniques for the Inference of Minimum Size Finite Automata.
Proceedings of the String Processing and Information Retrieval: A South American Symposium, 1998

A new algorithm for the reduction of incompletely specified finite state machines.
Proceedings of the 1998 IEEE/ACM International Conference on Computer-Aided Design, 1998

Using Complementation and Resequencing to Minimize Transitions.
Proceedings of the 35th Conference on Design Automation, 1998

Finite State Machine Decomposition For Low Power.
Proceedings of the 35th Conference on Design Automation, 1998

1997
Prime Implicant Computation Using Satisfiability Algorithms.
Proceedings of the 9th International Conference on Tools with Artificial Intelligence, 1997

1996
Using the Minimum Description Length Principle to Infer Reduced Ordered Decision Graphs.
Mach. Learn., 1996

Limits of Exact Algorithms For Inference of Minimum Size Finite State Machines.
Proceedings of the Algorithmic Learning Theory, 7th International Workshop, 1996

1995
Inferring Reduced Ordered Decision Graphs of Minimum Description Length.
Proceedings of the Machine Learning, 1995

1993
Learning Complex Boolean Functions: Algorithms and Applications.
Proceedings of the Advances in Neural Information Processing Systems 6, 1993

1992
Constructive Induction Using a Non-Greedy Strategy for Feature Selection.
Proceedings of the Ninth International Workshop on Machine Learning (ML 1992), 1992

1991
Learning Concepts by Synthesizing Minimal Threshold Gate Networks.
Proceedings of the Eighth International Workshop (ML91), 1991

LSAT-An Algorithm for the Synthesis of Two Level Threshold Gate Networks.
Proceedings of the 1991 IEEE/ACM International Conference on Computer-Aided Design, 1991


  Loading...