Eduardo Sany Laber

ORCID

Publication Activity (10 Years)

Years Active: 1998-2024
Publications (10 Years): 33

Top Venues

Pontifical Catholic University of Rio de Janeiro, Brazil (PHD)

Education History

Pontifical Catholic University of Rio de Janeiro, Brazil

PHD

Publications

Matheus Werner, Eduardo Sany Laber
Extracting section structure from resumes in Brazilian Portuguese. Expert Syst. Appl. 242 (2024)
Eduardo Sany Laber
The computational complexity of some explainable clustering problems. Inf. Process. Lett. 184 (2024)
Eduardo Sany Laber, Lucas Murtinho
Optimization of Inter-group Criteria for Clustering with Minimum Size Constraints. CoRR (2024)
Eduardo Sany Laber, Lucas Murtinho
-center and the maximum-spacing clustering problems. Theor. Comput. Sci. 949 (2023)
Lucas Pavanelli, Yohan Bonescki Gumiel, Thiago Castro Ferreira, Adriana S. Pagano, Eduardo Sany Laber
Bete: A Brazilian Portuguese Dataset for Named Entity Recognition and Relation Extraction in the Diabetes Healthcare Domain. BRACIS (3) (2023)
Eduardo Sany Laber, Lucas Murtinho, Felipe Oliveira
Shallow decision trees for explainable k-means clustering. Pattern Recognit. 137 (2023)
Eduardo Sany Laber, Lucas Murtinho
Optimization of Inter-group criteria for clustering with minimum size constraints. NeurIPS (2023)
Sérgio Freitas, Eduardo Sany Laber, Pedro Lazera, Marco Molinaro
Time-constrained learning. Pattern Recognit. 142 (2023)
Eduardo Sany Laber
The computational complexity of some explainable clustering problems. CoRR (2022)
Sergio Filho, Eduardo Sany Laber, Pedro Lazera, Marco Molinaro
Time-Constrained Learning. CoRR (2022)
Victor Feitosa Souza, Ferdinando Cicalese, Eduardo Sany Laber, Marco Molinaro
Decision Trees with Short Explainable Rules. NeurIPS (2022)
Ferdinando Cicalese, Eduardo Sany Laber
On the star decomposition of a graph: Hardness results and approximation for the max-min optimization problem. Discret. Appl. Math. 289 (2021)
Eduardo Sany Laber, Lucas Murtinho
On the price of explainability for some clustering problems. ICML (2021)
Ferdinando Cicalese, Eduardo Sany Laber
Information Theoretical Clustering Is Hard to Approximate. IEEE Trans. Inf. Theory 67 (1) (2021)
Eduardo Sany Laber, Lucas Murtinho
On the price of explainability for some clustering problems. CoRR (2021)
Eduardo Sany Laber, Lucas Murtinho, Felipe Oliveira
Shallow decision trees for explainable k-means clustering. CoRR (2021)
Ferdinando Cicalese, Sergio Filho, Eduardo Sany Laber, Marco Molinaro
Teaching with Limited Information on the Learner's Behaviour. ICML (2020)
Eduardo Sany Laber, Lucas Murtinho
Minimization of Gini Impurity: NP-completeness and Approximation Algorithm via Connections with the k-means Problem. LAGOS (2019)
Ferdinando Cicalese, Eduardo Sany Laber, Lucas Murtinho
New results on information theoretic clustering. ICML (2019)
Eduardo Sany Laber, Felipe de A. Mello Pereira
Splitting criteria for classification problems with multi-valued attributes and large number of classes. Pattern Recognit. Lett. 111 (2018)
Ferdinando Cicalese, Eduardo Sany Laber
Approximation Algorithms for Clustering via Weighted Impurity Measures. CoRR (2018)
Ferdinando Cicalese, Eduardo Sany Laber
Information theoretical clustering is hard to approximate. CoRR (2018)
Eduardo Sany Laber, Marco Molinaro, Felipe de A. Mello Pereira
Binary Partitions with Approximate Minimum Impurity. ICML (2018)
Aline Medeiros Saettler, Eduardo Sany Laber, Ferdinando Cicalese
Correction to: Trading Off Worst and Expected Cost in Decision Tree Problems. Algorithmica 80 (11) (2018)
Eduardo Sany Laber, Lucas Murtinho
Minimization of Gini impurity via connections with the k-means problem. CoRR (2018)
Aline Medeiros Saettler, Eduardo Sany Laber, Ferdinando Cicalese
Trading Off Worst and Expected Cost in Decision Tree Problems. Algorithmica 79 (3) (2017)
Pedro Moura, Eduardo Sany Laber, Hélio Lopes, Daniel Mesejo, Lucas Pavanelli, João Jardim, Francisco Thiesen, Gabriel Pujol
LSHSIM: A Locality Sensitive Hashing based method for multiple-point geostatistics. Comput. Geosci. 107 (2017)
Ferdinando Cicalese, Eduardo Sany Laber, Aline Medeiros Saettler
Decision Trees for Function Evaluation: Simultaneous Optimization of Worst and Expected Cost. Algorithmica 79 (3) (2017)
Aline Medeiros Saettler, Eduardo Sany Laber, Felipe de A. Mello Pereira
Decision tree classification with bounded number of errors. Inf. Process. Lett. 127 (2017)
Eduardo Sany Laber, Pedro Moura, Lucas Pavanelli
On Compression Techniques for Computing Convolutions. DCC (2016)
Aline Medeiros Saettler, Eduardo Sany Laber, Ferdinando Cicalese
Trading off Worst and Expected Cost in Decision Tree Problems. ISAAC (2015)
Aline Medeiros Saettler, Eduardo Sany Laber, Ferdinando Cicalese
Approximating decision trees with value dependent testing costs. Inf. Process. Lett. 115 (6-8) (2015)
Wilfredo Bardales Roncalla, Eduardo Sany Laber, Ferdinando Cicalese
Searching for a superlinear lower bounds for the Maximum Consecutive Subsums Problem and the (min, +)-convolution. CoRR (2015)
Eduardo Sany Laber, Wilfredo Bardales Roncalla, Ferdinando Cicalese
On lower bounds for the Maximum Consecutive Subsums Problem and the (min, +)-convolution. ISIT (2014)
Ferdinando Cicalese, Eduardo Sany Laber, Aline Medeiros Saettler
Diagnosis determination: decision trees optimizing simultaneously worst and expected testing cost. ICML (2014)
Ferdinando Cicalese, Tobias Jacobs, Eduardo Sany Laber, Marco Molinaro
Improved Approximation Algorithms for the Average-Case Tree Searching Problem. Algorithmica 68 (4) (2014)
Aline Medeiros Saettler, Eduardo Sany Laber, Ferdinando Cicalese
Trading off Worst and Expected Cost in Decision Tree Problems and a Value Dependent Model. CoRR (2014)
Ferdinando Cicalese, Eduardo Sany Laber, Aline Medeiros Saettler
Function Evaluation: decision trees optimizing simultaneously worst and expected testing cost. ISAIM (2014)
Ferdinando Cicalese, Eduardo Sany Laber, Oren Weimann, Raphael Yuster
Approximating the maximum consecutive subsums of a sequence. Theor. Comput. Sci. 525 (2014)
Ferdinando Cicalese, Travis Gagie, Emanuele Giaquinta, Eduardo Sany Laber, Zsuzsanna Lipták, Romeo Rizzi, Alexandru I. Tomescu
Indexes for Jumbled Pattern Matching in Strings, Trees and Graphs CoRR (2013)
Ferdinando Cicalese, Eduardo Sany Laber, Aline Medeiros Saettler
Decision Trees for the efficient evaluation of discrete functions: worst case and expected case analysis. CoRR (2013)
Ferdinando Cicalese, Travis Gagie, Emanuele Giaquinta, Eduardo Sany Laber, Zsuzsanna Lipták, Romeo Rizzi, Alexandru I. Tomescu
Indexes for Jumbled Pattern Matching in Strings, Trees and Graphs. SPIRE (2013)
Ferdinando Cicalese, Eduardo Sany Laber, Oren Weimann, Raphael Yuster
Near Linear Time Construction of an Approximate Index for All Maximum Consecutive Sub-sums of a Sequence. CPM (2012)
Ferdinando Cicalese, Tobias Jacobs, Eduardo Sany Laber, Caio Dias Valentim
The binary identification problem for weighted trees. Theor. Comput. Sci. 459 (2012)
Caio Dias Valentim, Eduardo Sany Laber, David Sotelo
Data Structures for Detecting Rare Variations in Time Series. ECML/PKDD (2) (2012)
Eduardo Teixeira Cardoso, Iam Vita Jabour, Eduardo Sany Laber, Rogério Rodrigues, Pedro Cardoso
An efficient language-independent method to extract content from news webpages. ACM Symposium on Document Engineering (2011)
Eduardo Sany Laber, Claudson F. Bornstein, Cristina G. Fernandes
Guest Editorial: Special Issue on Latin American Theoretical Informatics Symposium (LATIN). Algorithmica 59 (1) (2011)
Ferdinando Cicalese, Tobias Jacobs, Eduardo Sany Laber, Marco Molinaro
On the complexity of searching in trees and partially ordered structures. Theor. Comput. Sci. 412 (50) (2011)
Ferdinando Cicalese, Travis Gagie, Eduardo Sany Laber, Martin Milanic
Competitive Boolean function evaluation: Beyond monotonicity, and the symmetric case. Discret. Appl. Math. 159 (11) (2011)
Eduardo Sany Laber, Marco Molinaro
Improved approximations for the hotlink assignment problem. ACM Trans. Algorithms 7 (3) (2011)
Ferdinando Cicalese, Tobias Jacobs, Eduardo Sany Laber, Caio Dias Valentim
Binary Identification Problems for Weighted Trees. WADS (2011)
Eduardo Sany Laber, Marco Molinaro
An Approximation Algorithm for Binary Searching in Trees. Algorithmica 59 (4) (2011)
Ferdinando Cicalese, Eduardo Sany Laber
On the competitive ratio of evaluating priced functions. J. ACM 58 (3) (2011)
Tobias Jacobs, Ferdinando Cicalese, Eduardo Sany Laber, Marco Molinaro
On the Complexity of Searching in Trees: Average-Case Minimization. ICALP (1) (2010)
Ferdinando Cicalese, Tobias Jacobs, Eduardo Sany Laber, Marco Molinaro
On Greedy Algorithms for Decision Trees. ISAAC (2) (2010)
Ferdinando Cicalese, Travis Gagie, Eduardo Sany Laber, Martin Milanic
Competitive Boolean Function Evaluation: Beyond Monotonicity, and the Symmetric Case CoRR (2010)
Bruno Tenório Ávila, Eduardo Sany Laber
Merge source coding. ISIT (2009)
Eduardo Sany Laber, Críston Pereira de Souza, Iam Vita Jabour, Evelin Carvalho Freire de Amorim, Eduardo Teixeira Cardoso, Raúl P. Rentería, Lúcio Cunha Tinoco, Caio Dias Valentim
A fast and simple method for extracting relevant content from news webpages. CIKM (2009)
Ferdinando Cicalese, Eduardo Sany Laber, Marco Molinaro
On the Complexity of Searching in Trees: Average-case Minimization CoRR (2009)
Ferdinando Cicalese, Eduardo Sany Laber
Function Evaluation Via Linear Programming in the Priced Information Model. ICALP (1) (2008)
Eduardo Sany Laber
A randomized competitive algorithm for evaluating priced AND/OR trees. Theor. Comput. Sci. 401 (1-3) (2008)
Eduardo Sany Laber, Marco Molinaro
An Approximation Algorithm for Binary Searching in Trees. ICALP (1) (2008)
Críston de Souza, Eduardo Sany Laber, Caio Dias Valentim, Eduardo Teixeira Cardoso
A Polite Policy for Revisiting Web Pages. LA-WEB (2007)
Renato Carmo, Tomás Feder, Yoshiharu Kohayakawa, Eduardo Sany Laber, Rajeev Motwani, Liadan O'Callaghan, Rina Panigrahy, Dilys Thomas
Querying priced information in databases: The conjunctive case. ACM Trans. Algorithms 3 (1) (2007)
Vaston G. Costa, Edward Hermann Haeusler, Eduardo Sany Laber, Loana Tito Nogueira
A note on the size of minimal covers. Inf. Process. Lett. 102 (2-3) (2007)
Ornan Ori Gerstel, Shay Kutten, Eduardo Sany Laber, Rachel Matichin, David Peleg, Artur Alves Pessoa, Críston de Souza
Reducing human interactions in Web directory searches. ACM Trans. Inf. Syst. 25 (4) (2007)
Ferdinando Cicalese, Eduardo Sany Laber
On the competitive ratio of evaluating priced functions. SODA (2006)
Claudson F. Bornstein, Eduardo Sany Laber, Marcelo Mas
On Behalf of the Seller and Society: Bicriteria Mechanisms for Unit-Demand Auctions. LATIN (2006)
Eduardo Sany Laber
Hotlink Assignment on the Web. GTIT-C (2006)
Claudson F. Bornstein, Eduardo Sany Laber, Marcelo Albuquerque Fernandes Más
Randomized mechanisms for limited supply multi-item auctions. Electron. Notes Discret. Math. 19 (2005)
Ferdinando Cicalese, Eduardo Sany Laber
An Optimal Algorithm for Querying Priced Information: Monotone Boolean Functions and Game Trees. ESA (2005)
Ferdinando Cicalese, Eduardo Sany Laber
A new strategy for querying priced information. STOC (2005)
Artur Alves Pessoa, Eduardo Sany Laber, Críston de Souza
Efficient Implementation of Hotlink Assignment Algorithm for Web Sites. ALENEX/ANALC (2004)
Eduardo Sany Laber
A Randomized Competitive Algorithm for Evaluating Priced AND/OR Trees. STACS (2004)
Eduardo Sany Laber, Renato Carmo, Yoshiharu Kohayakawa
Querying Priced Information in Databases: The Conjunctive Case. LATIN (2004)
Renato Carmo, Jair Donadelli, Yoshiharu Kohayakawa, Eduardo Sany Laber
Searching in random partially ordered sets. Theor. Comput. Sci. 321 (1) (2004)
Artur Alves Pessoa, Eduardo Sany Laber, Críston de Souza
Efficient Algorithms for the Hotlink Assignment Problem: The Worst Case Search. ISAAC (2004)
Eduardo Sany Laber, Loana Tito Nogueira
On the hardness of the minimum height decision tree problem. Discret. Appl. Math. 144 (1-2) (2004)
Ruy Luiz Milidiú, Artur Alves Pessoa, Eduardo Sany Laber
The complexity of makespan minimization for pipeline transportation. Theor. Comput. Sci. 306 (1-3) (2003)
Eduardo Sany Laber, Emerson L. Monte Carmelo
A Note on multicolor bipartite Ramsey numbers for K_{2, n}. Ars Comb. 69 (2003)
Fábio Porto, Eduardo Sany Laber, Patrick Valduriez
Cherry Picking: A Semantic Query Processing Strategy for the Evaluation of Expensive Predicates. SBBD (2003)
Ruy Luiz Milidiú, Eduardo Sany Laber, Lorenza O. Moreno, Julio C. Duarte
A fast decoding method for prefix codes. DCC (2003)
Eduardo Sany Laber, Ojas Parekh, R. Ravi
Randomized Approximation Algorithms for Query Optimization Problems on Two Processors. ESA (2002)
Renato Carmo, Jair Donadelli, Yoshiharu Kohayakawa, Eduardo Sany Laber
Searching in Random Partially Ordered Sets. LATIN (2002)
Ruy Luiz Milidiú, Artur Alves Pessoa, Eduardo Sany Laber
Pipeline Transportation of Petroleum Products with No Due Dates. LATIN (2002)
Eduardo Sany Laber, Ruy Luiz Milidiú, Artur Alves Pessoa
On Binary Searching with Nonuniform Costs. SIAM J. Comput. 31 (4) (2002)
Eduardo Sany Laber, Leonardo Gomes Holanda
Improved bounds for asymmetric communication protocols. Inf. Process. Lett. 83 (4) (2002)
Eduardo Sany Laber, Ruy Luiz Milidiú, Artur Alves Pessoa
A strategy for searching with different access costs. Theor. Comput. Sci. 287 (2) (2002)
Ruy Luiz Milidiú, Artur Alves Pessoa, Eduardo Sany Laber
Complexity of Makespan Minimization for Pipeline Transportation of Petroleum Products. APPROX (2002)
Ruy Luiz Milidiú, Artur Alves Pessoa, Eduardo Sany Laber
Three space-economical algorithms for calculating minimum-redundancy prefix codes. IEEE Trans. Inf. Theory 47 (6) (2001)
Eduardo Sany Laber, Loana Tito Nogueira
Fast Searching in Trees. Electron. Notes Discret. Math. 7 (2001)
Eduardo Sany Laber, Ruy Luiz Milidiú, Artur Alves Pessoa
On binary searching with non-uniform costs. SODA (2001)
Eduardo Sany Laber, Leonardo Gomes Holanda
On asymmetric communication protocols. Electron. Notes Discret. Math. 7 (2001)
Ruy Luiz Milidiú, Eduardo Sany Laber
Bounding the Inefficiency of Length-Restricted Prefix Codes. Algorithmica 31 (4) (2001)
Ruy Luiz Milidiú, Eduardo Sany Laber
The WARM-UP Algorithm: A Lagrangian Construction of Length Restricted Huffman Codes. SIAM J. Comput. 30 (5) (2000)
Ruy Luiz Milidiú, Artur Alves Pessoa, Eduardo Sany Laber, Raúl P. Rentería
Fast Calculation of Optimal Strategies for Searching with Non-Uniform Costs. SPIRE (2000)
Ruy Luiz Milidiú, Eduardo Sany Laber
Linear Time Recognition of Optimal L-Restricted Prefix Codes (Extended Abstract). LATIN (2000)
Ruy Luiz Milidiú, Eduardo Sany Laber, Artur Alves Pessoa
A Work Efficient Parallel Algorithm for Constructing Huffman Codes. Data Compression Conference (1999)
Eduardo Sany Laber, Ruy Luiz Milidiú, Artur Alves Pessoa
Practical Constructions of L-restricted Alphabetic Prefix Codes. SPIRE/CRIWG (1999)
Ruy Luiz Milidiú, Artur Alves Pessoa, Eduardo Sany Laber
A Fast and Space-Economical Algorithm for Calculating Minimum Redundancy Prefix Codes. SPIRE/CRIWG (1999)

Eduardo Sany Laber.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Eduardo Sany Laber