Eduardo Sany Laber

Orcid: 0000-0002-9025-8333

According to our database1, Eduardo Sany Laber authored at least 94 papers between 1998 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
The computational complexity of some explainable clustering problems.
Inf. Process. Lett., February, 2024

2023
Time-constrained learning.
Pattern Recognit., October, 2023

Shallow decision trees for explainable k-means clustering.
Pattern Recognit., May, 2023

Nearly tight bounds on the price of explainability for the <i>k</i>-center and the maximum-spacing clustering problems.
Theor. Comput. Sci., March, 2023

Optimization of Inter-group criteria for clustering with minimum size constraints.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Bete: A Brazilian Portuguese Dataset for Named Entity Recognition and Relation Extraction in the Diabetes Healthcare Domain.
Proceedings of the Intelligent Systems - 12th Brazilian Conference, 2023

2022
Time-Constrained Learning.
CoRR, 2022

Decision Trees with Short Explainable Rules.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

2021
Information Theoretical Clustering Is Hard to Approximate.
IEEE Trans. Inf. Theory, 2021

On the star decomposition of a graph: Hardness results and approximation for the max-min optimization problem.
Discret. Appl. Math., 2021

On the price of explainability for some clustering problems.
Proceedings of the 38th International Conference on Machine Learning, 2021

2020
Teaching with Limited Information on the Learner's Behaviour.
Proceedings of the 37th International Conference on Machine Learning, 2020

Speeding up Word Mover's Distance and Its Variants via Properties of Distances Between Embeddings.
Proceedings of the ECAI 2020 - 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain, August 29 - September 8, 2020, 2020

2019
Minimization of Gini Impurity: NP-completeness and Approximation Algorithm via Connections with the k-means Problem.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

New results on information theoretic clustering.
Proceedings of the 36th International Conference on Machine Learning, 2019

2018
Splitting criteria for classification problems with multi-valued attributes and large number of classes.
Pattern Recognit. Lett., 2018

Minimization of Gini impurity via connections with the k-means problem.
CoRR, 2018

Approximation Algorithms for Clustering via Weighted Impurity Measures.
CoRR, 2018

Correction to: Trading Off Worst and Expected Cost in Decision Tree Problems.
Algorithmica, 2018

Binary Partitions with Approximate Minimum Impurity.
Proceedings of the 35th International Conference on Machine Learning, 2018

2017
Decision tree classification with bounded number of errors.
Inf. Process. Lett., 2017

LSHSIM: A Locality Sensitive Hashing based method for multiple-point geostatistics.
Comput. Geosci., 2017

Trading Off Worst and Expected Cost in Decision Tree Problems.
Algorithmica, 2017

Decision Trees for Function Evaluation: Simultaneous Optimization of Worst and Expected Cost.
Algorithmica, 2017

2016
On Compression Techniques for Computing Convolutions.
Proceedings of the 2016 Data Compression Conference, 2016

2015
Approximating decision trees with value dependent testing costs.
Inf. Process. Lett., 2015

Searching for a superlinear lower bounds for the Maximum Consecutive Subsums Problem and the (min, +)-convolution.
CoRR, 2015

2014
Approximating the maximum consecutive subsums of a sequence.
Theor. Comput. Sci., 2014

Trading off Worst and Expected Cost in Decision Tree Problems and a Value Dependent Model.
CoRR, 2014

Improved Approximation Algorithms for the Average-Case Tree Searching Problem.
Algorithmica, 2014

On lower bounds for the Maximum Consecutive Subsums Problem and the (min, +)-convolution.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Function Evaluation: decision trees optimizing simultaneously worst and expected testing cost.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2014

Diagnosis determination: decision trees optimizing simultaneously worst and expected testing cost.
Proceedings of the 31th International Conference on Machine Learning, 2014

2013
Decision Trees for the efficient evaluation of discrete functions: worst case and expected case analysis.
CoRR, 2013

Indexes for Jumbled Pattern Matching in Strings, Trees and Graphs.
Proceedings of the String Processing and Information Retrieval, 2013

2012
The binary identification problem for weighted trees.
Theor. Comput. Sci., 2012

Data Structures for Detecting Rare Variations in Time Series.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2012

Near Linear Time Construction of an Approximate Index for All Maximum Consecutive Sub-sums of a Sequence.
Proceedings of the Combinatorial Pattern Matching - 23rd Annual Symposium, 2012

2011
On the complexity of searching in trees and partially ordered structures.
Theor. Comput. Sci., 2011

Improved approximations for the hotlink assignment problem.
ACM Trans. Algorithms, 2011

On the competitive ratio of evaluating priced functions.
J. ACM, 2011

Competitive Boolean function evaluation: Beyond monotonicity, and the symmetric case.
Discret. Appl. Math., 2011

An Approximation Algorithm for Binary Searching in Trees.
Algorithmica, 2011

Guest Editorial: Special Issue on Latin American Theoretical Informatics Symposium (LATIN).
Algorithmica, 2011

Binary Identification Problems for Weighted Trees.
Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

An efficient language-independent method to extract content from news webpages.
Proceedings of the 2011 ACM Symposium on Document Engineering, 2011

2010
On Greedy Algorithms for Decision Trees.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

On the Complexity of Searching in Trees: Average-Case Minimization.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

2009
On the Complexity of Searching in Trees: Average-case Minimization
CoRR, 2009

Merge source coding.
Proceedings of the IEEE International Symposium on Information Theory, 2009

A fast and simple method for extracting relevant content from news webpages.
Proceedings of the 18th ACM Conference on Information and Knowledge Management, 2009

2008
A randomized competitive algorithm for evaluating priced AND/OR trees.
Theor. Comput. Sci., 2008

Function Evaluation Via Linear Programming in the Priced Information Model.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

2007
Reducing human interactions in Web directory searches.
ACM Trans. Inf. Syst., 2007

Querying priced information in databases: The conjunctive case.
ACM Trans. Algorithms, 2007

A note on the size of minimal covers.
Inf. Process. Lett., 2007

A Polite Policy for Revisiting Web Pages.
Proceedings of the Fifth Latin American Web Congress (LA-Web 2007), 31 October, 2007

2006
On Behalf of the Seller and Society: Bicriteria Mechanisms for Unit-Demand Auctions.
Proceedings of the LATIN 2006: Theoretical Informatics, 2006

Hotlink Assignment on the Web.
Proceedings of the General Theory of Information Transfer and Combinatorics, 2006

2005
Randomized mechanisms for limited supply multi-item auctions.
Electron. Notes Discret. Math., 2005

A new strategy for querying priced information.
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

An Optimal Algorithm for Querying Priced Information: Monotone Boolean Functions and Game Trees.
Proceedings of the Algorithms, 2005

2004
Searching in random partially ordered sets.
Theor. Comput. Sci., 2004

On the hardness of the minimum height decision tree problem.
Discret. Appl. Math., 2004

Querying Priced Information in Databases: The Conjunctive Case.
Proceedings of the LATIN 2004: Theoretical Informatics, 2004

Efficient Algorithms for the Hotlink Assignment Problem: The Worst Case Search.
Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

Efficient Implementation of Hotlink Assignment Algorithm for Web Sites.
Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics, 2004

2003
The complexity of makespan minimization for pipeline transportation.
Theor. Comput. Sci., 2003

A Note on multicolor bipartite Ramsey numbers for K_{2, n}.
Ars Comb., 2003

Cherry Picking: A Semantic Query Processing Strategy for the Evaluation of Expensive Predicates.
Proceedings of the XVIII Simpósio Brasileiro de Bancos de Dados, 2003

A fast decoding method for prefix codes.
Proceedings of the 2003 Data Compression Conference (DCC 2003), 2003

2002
A strategy for searching with different access costs.
Theor. Comput. Sci., 2002

On Binary Searching with Nonuniform Costs.
SIAM J. Comput., 2002

Improved bounds for asymmetric communication protocols.
Inf. Process. Lett., 2002

Pipeline Transportation of Petroleum Products with No Due Dates.
Proceedings of the LATIN 2002: Theoretical Informatics, 2002

Randomized Approximation Algorithms for Query Optimization Problems on Two Processors.
Proceedings of the Algorithms, 2002

Complexity of Makespan Minimization for Pipeline Transportation of Petroleum Products.
Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2002

2001
Three space-economical algorithms for calculating minimum-redundancy prefix codes.
IEEE Trans. Inf. Theory, 2001

Fast Searching in Trees.
Electron. Notes Discret. Math., 2001

On asymmetric communication protocols.
Electron. Notes Discret. Math., 2001

Bounding the Inefficiency of Length-Restricted Prefix Codes.
Algorithmica, 2001

On binary searching with non-uniform costs.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

2000
The WARM-UP Algorithm: A Lagrangian Construction of Length Restricted Huffman Codes.
SIAM J. Comput., 2000

Fast Calculation of Optimal Strategies for Searching with Non-Uniform Costs.
Proceedings of the Seventh International Symposium on String Processing and Information Retrieval, 2000

Linear Time Recognition of Optimal L-Restricted Prefix Codes (Extended Abstract).
Proceedings of the LATIN 2000: Theoretical Informatics, 2000

1999
CóDigos de Prefixo: Algoritmos E Cotas.
PhD thesis, 1999

Bounding the Compression Loss of the FGK Algorithm.
J. Algorithms, 1999

A Fast and Space-Economical Algorithm for Calculating Minimum Redundancy Prefix Codes.
Proceedings of the Sixth International Symposium on String Processing and Information Retrieval and Fifth International Workshop on Groupware, 1999

Practical Constructions of L-restricted Alphabetic Prefix Codes.
Proceedings of the Sixth International Symposium on String Processing and Information Retrieval and Fifth International Workshop on Groupware, 1999

Strategies for Searching with Different Access Costs.
Proceedings of the Algorithms, 1999

Two Space-Economical Algorithms for Calculating Minimum Redundancy Prefix Codes.
Proceedings of the Data Compression Conference, 1999

A Work Efficient Parallel Algorithm for Constructing Huffman Codes.
Proceedings of the Data Compression Conference, 1999

Efficient Implementation of the WARM-UP Algorithm for the Construction of Length-Restricted Prefix Codes.
Proceedings of the Algorithm Engineering and Experimentation, 1999

1998
In-Place Length-Restricted Prefix Coding.
Proceedings of the String Processing and Information Retrieval: A South American Symposium, 1998


  Loading...