Extracting section structure from resumes in Brazilian Portuguese von Werner, Matheus, Laber, Eduardo

Volltext

The computational complexity of some explainable clustering problems von Laber, Eduardo Sany

Volltext

Shallow decision trees for explainable k-means clustering von Laber, Eduardo, Murtinho, Lucas, Oliveira, Felipe

Volltext

Information Theoretical Clustering Is Hard to Approximate von Cicalese, Ferdinando, Laber, Eduardo Sany

Volltext

A randomized competitive algorithm for evaluating priced AND/OR trees von Laber, Eduardo Sany

Volltext

On the star decomposition of a graph: Hardness results and approximation for the max–min optimization problem von Cicalese, Ferdinando, Laber, Eduardo Sany

Volltext

Time-constrained learning von Freitas, Sergio, Laber, Eduardo, Lazera, Pedro, Molinaro, Marco

Volltext

Nearly tight bounds on the price of explainability for the k-center and the maximum-spacing clustering problems von Laber, Eduardo Sany, Saadi Murtinho, Lucas

Volltext

Improved approximations for the hotlink assignment problem von Laber, Eduardo, Molinaro, Marco

Volltext

Trading Off Worst and Expected Cost in Decision Tree Problems von Saettler, Aline, Laber, Eduardo, Cicalese, Ferdinando

Volltext

Decision Trees for Function Evaluation: Simultaneous Optimization of Worst and Expected Cost von Cicalese, Ferdinando, Laber, Eduardo, Saettler, Aline

Volltext

Efficient Algorithms for the Hotlink Assignment Problem: The Worst Case Search von Pessoa, Artur Alves, Laber, Eduardo Sany, de Souza, Críston

Volltext

Correction to: Trading Off Worst and Expected Cost in Decision Tree Problems von Saettler, Aline, Laber, Eduardo, Cicalese, Ferdinando

Volltext

Decision tree classification with bounded number of errors von Saettler, Aline, Laber, Eduardo, de A. Mello Pereira, Felipe

Volltext

On Behalf of the Seller and Society: Bicriteria Mechanisms for Unit-Demand Auctions von Bornstein, Claudson, Laber, Eduardo Sany, Mas, Marcelo

Volltext

A note on the size of minimal covers von COSTA, Vaston, HAEUSLER, Edward, LABER, Eduardo S, NOGUEIRA, Loana

Volltext

Splitting criteria for classification problems with multi-valued attributes and large number of classes von Laber, Eduardo Sany, de A. Mello Pereira, Felipe

Volltext

An Approximation Algorithm for Binary Searching in Trees von Laber, Eduardo, Molinaro, Marco

Volltext

LSHSIM: A Locality Sensitive Hashing based method for multiple-point geostatistics von Moura, Pedro, Laber, Eduardo, Lopes, Hélio, Mesejo, Daniel, Pavanelli, Lucas, Jardim, João, Thiesen, Francisco, Pujol, Gabriel

Volltext

Approximating decision trees with value dependent testing costs von Saettler, Aline, Laber, Eduardo, Cicalese, Ferdinando

Volltext