Eduardo Sany Laber

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