Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Laber, Eduardo
71  Ergebnisse:
Personensuche X
?
1

Extracting section structure from resumes in Brazilian Port..:

Werner, Matheus ; Laber, Eduardo
Expert Systems with Applications.  242 (2024)  - p. 122495 , 2024
Link: https://doi.org/10.1016/..
 
?
2

Time-constrained learning:

Freitas, Sergio ; Laber, Eduardo ; Lazera, Pedro.
Pattern Recognition.  142 (2023)  - p. 109672 , 2023
Link: https://doi.org/10.1016/..
 
?
3

Bete: A Brazilian Portuguese Dataset for Named Entity Recog..:

, In: Intelligent Systems; Lecture Notes in Computer Science,
Pavanelli, Lucas ; Gumiel, Yohan Bonescki ; Ferreira, Thiago.. - p. 256-267 , 2023
Link: https://doi.org/10.1007/..
 
?
4

Shallow decision trees for explainable k-means clustering:

Laber, Eduardo ; Murtinho, Lucas ; Oliveira, Felipe
Pattern Recognition.  137 (2023)  - p. 109239 , 2023
Link: https://doi.org/10.1016/..
 
?
5

Minimization of Gini Impurity: NP-completeness and Approxim..:

Laber, Eduardo ; Murtinho, Lucas
Electronic Notes in Theoretical Computer Science.  346 (2019)  - p. 567-576 , 2019
Link: https://doi.org/10.1016/..
 
?
6

Correction to: Trading Off Worst and Expected Cost in Decis..:

Saettler, Aline ; Laber, Eduardo ; Cicalese, Ferdinando
Algorithmica.  80 (2018)  11 - p. 3431-3436 , 2018
Link: https://doi.org/10.1007/..
 
?
7

LSHSIM: A Locality Sensitive Hashing based method for multi..:

Moura, Pedro ; Laber, Eduardo ; Lopes, Hélio...
Computers & Geosciences.  107 (2017)  - p. 49-60 , 2017
Link: https://doi.org/10.1016/..
 
?
8

Decision tree classification with bounded number of errors:

Saettler, Aline ; Laber, Eduardo ; de A. Mello Pereira, Felipe
Information Processing Letters.  127 (2017)  - p. 27-31 , 2017
Link: https://doi.org/10.1016/..
 
?
9

Decision Trees for Function Evaluation: Simultaneous Optimi..:

Cicalese, Ferdinando ; Laber, Eduardo ; Saettler, Aline
Algorithmica.  79 (2016)  3 - p. 763-796 , 2016
Link: https://doi.org/10.1007/..
 
?
10

Trading Off Worst and Expected Cost in Decision Tree Proble..:

Saettler, Aline ; Laber, Eduardo ; Cicalese, Ferdinando
Algorithmica.  79 (2016)  3 - p. 886-908 , 2016
Link: https://doi.org/10.1007/..
 
?
11

Approximating decision trees with value dependent testing c..:

Saettler, Aline ; Laber, Eduardo ; Cicalese, Ferdinando
Information Processing Letters.  115 (2015)  6-8 - p. 594-599 , 2015
Link: https://doi.org/10.1016/..
 
?
12

Approximating the maximum consecutive subsums of a sequence:

Cicalese, Ferdinando ; Laber, Eduardo ; Weimann, Oren.
Theoretical Computer Science.  525 (2014)  - p. 130-137 , 2014
Link: https://doi.org/10.1016/..
 
?
13

The binary identification problem for weighted trees:

Cicalese, Ferdinando ; Jacobs, Tobias ; Laber, Eduardo.
Theoretical Computer Science.  459 (2012)  - p. 100-112 , 2012
Link: https://doi.org/10.1016/..
 
?
14

Improved Approximation Algorithms for the Average-Case Tree..:

Cicalese, Ferdinando ; Jacobs, Tobias ; Laber, Eduardo.
Algorithmica.  68 (2012)  4 - p. 1045-1074 , 2012
Link: https://doi.org/10.1007/..
 
?
15

An efficient language-independent method to extract content..:

, In: Proceedings of the 11th ACM symposium on Document engineering,
Cardoso, Eduardo ; Jabour, Iam ; Laber, Eduardo.. - p. 121-128 , 2011
Link: https://dl.acm.org/doi/1..
 
1-15