The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Arlindo L. Oliveira: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Arlindo L. Oliveira, Stephen Edwards
    Limits of Exact Algorithms For Inference of Minimum Size Finite State Machines. [Citation Graph (0, 0)][DBLP]
    ALT, 1996, pp:59-66 [Conf]
  2. Alexandra M. Carvalho, Ana T. Freitas, Arlindo L. Oliveira, Marie-France Sagot
    A highly scalable algorithm for the extraction of CIS-regulatory regions. [Citation Graph (0, 0)][DBLP]
    APBC, 2005, pp:273-282 [Conf]
  3. Sara C. Madeira, Arlindo L. Oliveira
    An Efficient Biclustering Algorithm for Finding Genes with Similar Patterns in Time-series Expression Data. [Citation Graph (0, 0)][DBLP]
    APBC, 2007, pp:67-80 [Conf]
  4. José C. Monteiro, Arlindo L. Oliveira
    FSM decomposition by direct circuit manipulation applied to low power design. [Citation Graph (0, 0)][DBLP]
    ASP-DAC, 2000, pp:351-358 [Conf]
  5. Luís M. S. Russo, Arlindo L. Oliveira
    An Efficient Algorithm for Generating Super Condensed Neighborhoods. [Citation Graph (0, 0)][DBLP]
    CPM, 2005, pp:104-115 [Conf]
  6. José C. Monteiro, Arlindo L. Oliveira
    Finite State Machine Decomposition For Low Power. [Citation Graph (0, 0)][DBLP]
    DAC, 1998, pp:758-763 [Conf]
  7. Rajeev Murgai, Masahiro Fujita, Arlindo L. Oliveira
    Using Complementation and Resequencing to Minimize Transitions. [Citation Graph (0, 0)][DBLP]
    DAC, 1998, pp:694-697 [Conf]
  8. Arlindo L. Oliveira
    Robust Techniques for Watermarking Sequential Circuit Designs. [Citation Graph (0, 0)][DBLP]
    DAC, 1999, pp:837-842 [Conf]
  9. José M. Fernandes, Marcelino B. Santos, Arlindo L. Oliveira, João C. Teixeira
    A Probabilistic Method for the Computation of Testability of RTL Constructs. [Citation Graph (0, 0)][DBLP]
    DATE, 2004, pp:176-181 [Conf]
  10. Ana T. Freitas, Arlindo L. Oliveira
    Implicit Resolution of the Chapman-Kolmogorov Equations for Sequential Circuits: An Application in Power Estimation. [Citation Graph (0, 0)][DBLP]
    DATE, 2003, pp:10764-10769 [Conf]
  11. José M. Fernandes, Marcelino B. Santos, Arlindo L. Oliveira, João C. Teixeira
    Probabilistic Testability Analysis and DFT Methods at RTL. [Citation Graph (0, 0)][DBLP]
    DDECS, 2006, pp:216-217 [Conf]
  12. Sara C. Madeira, Arlindo L. Oliveira, Catarina S. Conceição
    A Data Mining Approach to Credit Risk Evaluation and Behaviour Scoring. [Citation Graph (0, 0)][DBLP]
    EPIA, 2003, pp:184-188 [Conf]
  13. André L. Martins, Helena Sofia Pinto, Arlindo L. Oliveira
    Using a More Powerful Teacher to Reduce the Number of Queries of the L* Algorithm in Practical Applications. [Citation Graph (0, 0)][DBLP]
    EPIA, 2005, pp:325-336 [Conf]
  14. José Poveda, Michael Gould, Arlindo L. Oliveira
    A New Quick Point Location Algorithm. [Citation Graph (0, 0)][DBLP]
    ER (Workshops), 2004, pp:184-196 [Conf]
  15. Arlindo L. Oliveira, Rajeev Murgai
    An Exact Gate Assignment Algorithm for Tree Circuits Under Rise and Fall Delays. [Citation Graph (0, 0)][DBLP]
    ICCAD, 2000, pp:451-457 [Conf]
  16. Arlindo L. Oliveira, Alberto L. Sangiovanni-Vincentelli
    LSAT-An Algorithm for the Synthesis of Two Level Threshold Gate Networks. [Citation Graph (0, 0)][DBLP]
    ICCAD, 1991, pp:130-133 [Conf]
  17. Jorge M. Pena, Arlindo L. Oliveira
    A new algorithm for the reduction of incompletely specified finite state machines. [Citation Graph (0, 0)][DBLP]
    ICCAD, 1998, pp:482-489 [Conf]
  18. Joel R. Phillips, João Afonso, Arlindo L. Oliveira, Luis Miguel Silveira
    Analog Macromodeling using Kernel Methods. [Citation Graph (0, 0)][DBLP]
    ICCAD, 2003, pp:446-453 [Conf]
  19. Cláudia Antunes, Arlindo L. Oliveira
    Inference of Sequential Association Rules Guided by Context-Free Grammars. [Citation Graph (0, 0)][DBLP]
    ICGI, 2002, pp:1-13 [Conf]
  20. Arlindo L. Oliveira, Alberto L. Sangiovanni-Vincentelli
    Learning Concepts by Synthesizing Minimal Threshold Gate Networks. [Citation Graph (0, 0)][DBLP]
    ML, 1991, pp:193-197 [Conf]
  21. Arlindo L. Oliveira, Alberto L. Sangiovanni-Vincentelli
    Constructive Induction Using a Non-Greedy Strategy for Feature Selection. [Citation Graph (0, 0)][DBLP]
    ML, 1992, pp:355-360 [Conf]
  22. Arlindo L. Oliveira, Alberto L. Sangiovanni-Vincentelli
    Inferring Reduced Ordered Decision Graphs of Minimum Description Length. [Citation Graph (0, 0)][DBLP]
    ICML, 1995, pp:421-429 [Conf]
  23. Vasco M. Manquinho, Paulo F. Flores, João P. Marques Silva, Arlindo L. Oliveira
    Prime Implicant Computation Using Satisfiability Algorithms. [Citation Graph (0, 0)][DBLP]
    ICTAI, 1997, pp:232-239 [Conf]
  24. Antônio Mota, Nuno Ferreira, Arlindo L. Oliveira, José C. Monteiro
    Integrating Dynamic Power Management in the Design Flow. [Citation Graph (0, 0)][DBLP]
    VLSI, 1999, pp:233-244 [Conf]
  25. Cláudia Antunes, Arlindo L. Oliveira
    Constraint Relaxations for Discovering Unknown Sequential Patterns. [Citation Graph (0, 0)][DBLP]
    KDID, 2004, pp:11-32 [Conf]
  26. Cláudia Antunes, Arlindo L. Oliveira
    Generalization of Pattern-Growth Methods for Sequential Pattern Mining with Gap Constraints. [Citation Graph (0, 0)][DBLP]
    MLDM, 2003, pp:239-251 [Conf]
  27. Arlindo L. Oliveira, Alberto L. Sangiovanni-Vincentelli
    Learning Complex Boolean Functions: Algorithms and Applications. [Citation Graph (0, 0)][DBLP]
    NIPS, 1993, pp:911-918 [Conf]
  28. Paulo Trezentos, Arlindo L. Oliveira
    Metrics for Grid Applicability: A Distributed Elliptic Curve Platform Assessment. [Citation Graph (0, 0)][DBLP]
    PPAM, 2003, pp:864-871 [Conf]
  29. Alexandra M. Carvalho, Arlindo L. Oliveira, Ana T. Freitas, Marie-France Sagot
    A parallel algorithm for the extraction of structured motifs. [Citation Graph (0, 0)][DBLP]
    SAC, 2004, pp:147-153 [Conf]
  30. Ana Cardoso-Cachopo, Arlindo L. Oliveira
    Semi-supervised single-label text categorization using centroid-based classifiers. [Citation Graph (0, 0)][DBLP]
    SAC, 2007, pp:844-851 [Conf]
  31. Luís Pedro Coelho, Arlindo L. Oliveira
    Dotted Suffix Trees A Structure for Approximate Text Indexing. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2006, pp:329-336 [Conf]
  32. Alexandra M. Carvalho, Ana T. Freitas, Arlindo L. Oliveira, Marie-France Sagot
    Efficient Extraction of Structured Motifs Using Box-Links. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2004, pp:267-268 [Conf]
  33. Ana Cardoso-Cachopo, Arlindo L. Oliveira
    An Empirical Comparison of Text Categorization Methods. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2003, pp:183-196 [Conf]
  34. Arlindo L. Oliveira, João P. Marques Silva
    Efficient Search Techniques for the Inference of Minimum Size Finite Automata. [Citation Graph (0, 0)][DBLP]
    SPIRE, 1998, pp:81-89 [Conf]
  35. Luís M. S. Russo, Arlindo L. Oliveira
    Faster Generation of Super Condensed Neighbourhoods Using Finite Automata. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2005, pp:246-255 [Conf]
  36. Luís M. S. Russo, Arlindo L. Oliveira
    A Compressed Self-index Using a Ziv-Lempel Dictionary. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2006, pp:163-180 [Conf]
  37. Sara C. Madeira, Arlindo L. Oliveira
    A Linear Time Biclustering Algorithm for Time Series Gene Expression Data. [Citation Graph (0, 0)][DBLP]
    WABI, 2005, pp:39-52 [Conf]
  38. Nuno D. Mendes, Ana C. Casimiro, Pedro M. Santos, Isabel Sá-Correia, Arlindo L. Oliveira, Ana T. Freitas
    MUSA: a parameter free algorithm for the identification of biologically significant motifs. [Citation Graph (0, 0)][DBLP]
    Bioinformatics, 2006, v:22, n:24, pp:2996-3002 [Journal]
  39. Alberto H. F. Laender, Arlindo L. Oliveira
    Special issue on string processing and information retrieval. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2004, v:2, n:1, pp:1-2 [Journal]
  40. Arlindo L. Oliveira, João P. Marques Silva
    Efficient Algorithms for the Inference of Minimum Size DFAs. [Citation Graph (0, 0)][DBLP]
    Machine Learning, 2001, v:44, n:1/2, pp:93-119 [Journal]
  41. Arlindo L. Oliveira, Alberto L. Sangiovanni-Vincentelli
    Using the Minimum Description Length Principle to Infer Reduced Ordered Decision Graphs. [Citation Graph (0, 0)][DBLP]
    Machine Learning, 1996, v:25, n:1, pp:23-50 [Journal]
  42. Miguel C. Teixeira, Pedro Monteiro, Pooja Jain, Sandra Tenreiro, Alexandra R. Fernandes, Nuno P. Mira, Marta Alenquer, Ana T. Freitas, Arlindo L. Oliveira, Isabel Sá-Correia
    The YEASTRACT database: a tool for the analysis of transcription regulatory associations in Saccharomyces cerevisiae. [Citation Graph (0, 0)][DBLP]
    Nucleic Acids Research, 2006, v:34, n:Database-Issue, pp:446-451 [Journal]
  43. Miguel Bugalho, Arlindo L. Oliveira
    Inference of regular languages using state merging algorithms with search. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition, 2005, v:38, n:9, pp:1457-1467 [Journal]
  44. Arlindo L. Oliveira, Luca P. Carloni, Tiziano Villa, Alberto L. Sangiovanni-Vincentelli
    Exact Minimization of Binary Decision Diagrams Using Implicit Techniques. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1998, v:47, n:11, pp:1282-1296 [Journal]
  45. Arlindo L. Oliveira
    Techniques for the creation of digital watermarks in sequentialcircuit designs. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 2001, v:20, n:9, pp:1101-1117 [Journal]
  46. Arlindo L. Oliveira, Rajeev Murgai
    On the problem of gate assignment under different rise and fall delays. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 2003, v:22, n:6, pp:807-814 [Journal]
  47. Jorge M. Pena, Arlindo L. Oliveira
    A new algorithm for exact reduction of incompletely specified finite state machines. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 1999, v:18, n:11, pp:1619-1632 [Journal]
  48. Alexandra M. Carvalho, Ana T. Freitas, Arlindo L. Oliveira, Marie-France Sagot
    An Efficient Algorithm for the Identification of Structured Motifs in DNA Promoter Sequences. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Comput. Biology Bioinform., 2006, v:3, n:2, pp:126-140 [Journal]
  49. Sara C. Madeira, Arlindo L. Oliveira
    Biclustering Algorithms for Biological Data Analysis: A Survey. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Comput. Biology Bioinform., 2004, v:1, n:1, pp:24-45 [Journal]
  50. João Marques-Silva, Inês Lynce, Ana Graça, Arlindo L. Oliveira
    Efficient and Tight Upper Bounds for Haplotype Inference by Pure Parsimony Using Delayed Haplotype Selection. [Citation Graph (0, 0)][DBLP]
    EPIA Workshops, 2007, pp:621-632 [Conf]
  51. Luís M. S. Russo, Gonzalo Navarro, Arlindo L. Oliveira
    Approximate String Matching with Lempel-Ziv Compressed Indexes. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2007, pp:264-275 [Conf]
  52. Ana Graça, João Marques-Silva, Inês Lynce, Arlindo L. Oliveira
    Efficient Haplotype Inference with Pseudo-boolean Optimization. [Citation Graph (0, 0)][DBLP]
    AB, 2007, pp:125-139 [Conf]
  53. José C. Monteiro, Arlindo L. Oliveira
    Implicit FSM decomposition applied to low-power design. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. VLSI Syst., 2002, v:10, n:5, pp:560-565 [Journal]

  54. Efficient Learning of Bayesian Network Classifiers. [Citation Graph (, )][DBLP]


  55. Efficient Haplotype Inference with Combined CP and OR Techniques. [Citation Graph (, )][DBLP]


  56. Dynamic Fully-Compressed Suffix Trees. [Citation Graph (, )][DBLP]


  57. Parallel and Distributed Compressed Indexes. [Citation Graph (, )][DBLP]


  58. On the Use of Suffix Arrays for Memory-Efficient Lempel-Ziv Data Compression. [Citation Graph (, )][DBLP]


  59. Ontology Design Principles and Normalization Techniques in the Web. [Citation Graph (, )][DBLP]


  60. Learning bayesian networks consistent with the optimal branching. [Citation Graph (, )][DBLP]


  61. Haplotype Inference with Boolean Constraint Solving: An Overview. [Citation Graph (, )][DBLP]


  62. Efficient Biclustering Algorithms for Time Series Gene Expression Data Analysis. [Citation Graph (, )][DBLP]


  63. Apt-pbo: solving the software dependency problem using pseudo-boolean optimization. [Citation Graph (, )][DBLP]


  64. Fully-Compressed Suffix Trees. [Citation Graph (, )][DBLP]


  65. Indexed Hierarchical Approximate String Matching. [Citation Graph (, )][DBLP]


  66. Clique Analysis of Query Log Graphs. [Citation Graph (, )][DBLP]


  67. An Evaluation of the Impact of Side Chain Positioning on the Accuracy of Discrete Models of Protein Structures. [Citation Graph (, )][DBLP]


  68. Identification of Transcription Factor Binding Sites in Promoter Regions by Modularity Analysis of the Motif Co-occurrence Graph. [Citation Graph (, )][DBLP]


  69. Suffix Arrays - A Competitive Choice for Fast Lempel-Ziv Compressions. [Citation Graph (, )][DBLP]


  70. Using Grammatical Inference Techniques to Learn Ontologies that Describe the Structure of Domain Instances. [Citation Graph (, )][DBLP]


  71. An analysis of the positional distribution of DNA motifs in promoter regions and its biological relevance. [Citation Graph (, )][DBLP]


  72. On the Use of Suffix Arrays for Memory-Efficient Lempel-Ziv Data Compression [Citation Graph (, )][DBLP]


  73. Time and Memory Efficient Lempel-Ziv Compression Using Suffix Arrays [Citation Graph (, )][DBLP]


Search in 0.008secs, Finished in 0.014secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002