Eduardo Sany Laber
Eduardo Sany Laber
Bestätigte E-Mail-Adresse bei
Zitiert von
Zitiert von
Searching in random partially ordered sets
R Carmo, J Donadelli, Y Kohayakawa, E Laber
Theoretical Computer Science 321 (1), 41-57, 2004
Bounding the inefficiency of length-restricted prefix codes
Milidiú, Laber
Algorithmica 31, 513-529, 2001
On the hardness of the minimum height decision tree problem
ES Laber, LT Nogueira
Discrete Applied Mathematics 144 (1-2), 209-212, 2004
On the complexity of searching in trees and partially ordered structures
F Cicalese, T Jacobs, E Laber, M Molinaro
Theoretical Computer Science 412 (50), 6879-6896, 2011
On the competitive ratio of evaluating priced functions
F Cicalese, ES Laber
Journal of the ACM (JACM) 58 (3), 1-40, 2011
The warm-up algorithm: a Lagrangian construction of length restricted Huffman codes
RL Milidiu, ES Laber
SIAM Journal on Computing 30 (5), 1405-1426, 2000
On the price of explainability for some clustering problems
ES Laber, L Murtinho
International Conference on Machine Learning, 5915-5925, 2021
Minimization of Gini Impurity: NP-completeness and Approximation Algorithm via Connections with the k-means Problem
E Laber, L Murtinho
Electronic Notes in Theoretical Computer Science 346, 567-576, 2019
An efficient language-independent method to extract content from news webpages
E Cardoso, I Jabour, E Laber, R Rodrigues, P Cardoso
Proceedings of the 11th ACM symposium on Document engineering, 121-128, 2011
Binary partitions with approximate minimum impurity
E Laber, M Molinaro, FM Pereira
International Conference on Machine Learning, 2854-2862, 2018
Approximating the maximum consecutive subsums of a sequence
F Cicalese, E Laber, O Weimann, R Yuster
Theoretical Computer Science 525, 130-137, 2014
Diagnosis determination: decision trees optimizing simultaneously worst and expected testing cost
F Cicalese, E Laber, AM Saettler
International conference on machine learning, 414-422, 2014
The binary identification problem for weighted trees
F Cicalese, T Jacobs, E Laber, C Valentim
Theoretical Computer Science 459, 100-112, 2012
A fast and simple method for extracting relevant content from news webpages
ES Laber, CP de Souza, IV Jabour, ECF de Amorim, ET Cardoso, ...
Proceedings of the 18th ACM conference on Information and knowledge …, 2009
Shallow decision trees for explainable k-means clustering
E Laber, L Murtinho, F Oliveira
Pattern Recognition 137, 109239, 2023
Decision tree classification with bounded number of errors
A Saettler, E Laber, FAM Pereira
Information Processing Letters 127, 27-31, 2017
On greedy algorithms for decision trees
F Cicalese, T Jacobs, E Laber, M Molinaro
International Symposium on Algorithms and Computation, 206-217, 2010
Efficient algorithms for the hotlink assignment problem: The worst case search
AA Pessoa, ES Laber, C de Souza
International Symposium on Algorithms and Computation, 778-792, 2004
On binary searching with nonuniform costs
ES Laber, RL Milidiú, AA Pessoa
SIAM Journal on Computing 31 (4), 1022-1047, 2002
Efficient implementation of the WARM-UP algorithm for the construction of length-restricted prefix codes
RL Milidiú, AA Pessoa, ES Laber
Algorithm Engineering and Experimentation: International Workshop ALENEX’99 …, 1999
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20