Eduardo Sany Laber
Orcid: 0000-0002-9025-8333
According to our database1,
Eduardo Sany Laber
authored at least 97 papers
between 1998 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Inf. Process. Lett., February, 2024
Expert Syst. Appl., 2024
New bounds on the cohesion of complete-link and other linkage methods for agglomeration clustering.
CoRR, 2024
New Bounds on the Cohesion of Complete-link and Other Linkage Methods for Agglomerative Clustering.
Proceedings of the Forty-first International Conference on Machine Learning, 2024
2023
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
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
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022
2021
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
Proceedings of the 38th International Conference on Machine Learning, 2021
2020
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
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
Algorithmica, 2018
Proceedings of the 35th International Conference on Machine Learning, 2018
2017
Inf. Process. Lett., 2017
Comput. Geosci., 2017
Decision Trees for Function Evaluation: Simultaneous Optimization of Worst and Expected Cost.
Algorithmica, 2017
2016
Proceedings of the 2016 Data Compression Conference, 2016
2015
Inf. Process. Lett., 2015
Searching for a superlinear lower bounds for the Maximum Consecutive Subsums Problem and the (min, +)-convolution.
CoRR, 2015
2014
Theor. Comput. Sci., 2014
Trading off Worst and Expected Cost in Decision Tree Problems and a Value Dependent Model.
CoRR, 2014
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
Proceedings of the String Processing and Information Retrieval, 2013
2012
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
Theor. Comput. Sci., 2011
ACM Trans. Algorithms, 2011
Competitive Boolean function evaluation: Beyond monotonicity, and the symmetric case.
Discret. Appl. Math., 2011
Guest Editorial: Special Issue on Latin American Theoretical Informatics Symposium (LATIN).
Algorithmica, 2011
Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011
Proceedings of the 2011 ACM Symposium on Document Engineering, 2011
2010
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010
2009
Proceedings of the IEEE International Symposium on Information Theory, 2009
Proceedings of the 18th ACM Conference on Information and Knowledge Management, 2009
2008
Theor. Comput. Sci., 2008
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008
2007
ACM Trans. Algorithms, 2007
Proceedings of the Fifth Latin American Web Congress (LA-Web 2007), 31 October, 2007
2006
Proceedings of the LATIN 2006: Theoretical Informatics, 2006
Proceedings of the General Theory of Information Transfer and Combinatorics, 2006
2005
Electron. Notes Discret. Math., 2005
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
Discret. Appl. Math., 2004
Proceedings of the LATIN 2004: Theoretical Informatics, 2004
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
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
Proceedings of the 2003 Data Compression Conference (DCC 2003), 2003
2002
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
IEEE Trans. Inf. Theory, 2001
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001
2000
SIAM J. Comput., 2000
Proceedings of the Seventh International Symposium on String Processing and Information Retrieval, 2000
Proceedings of the LATIN 2000: Theoretical Informatics, 2000
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
Proceedings of the Sixth International Symposium on String Processing and Information Retrieval and Fifth International Workshop on Groupware, 1999
Proceedings of the Algorithms, 1999
Proceedings of the Data Compression Conference, 1999
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
Proceedings of the String Processing and Information Retrieval: A South American Symposium, 1998