Zobrazeno 1 - 10
of 268
pro vyhledávání: '"Eduardo Sany Laber"'
Autor:
Eduardo Sany Laber
We study the computational complexity of some explainable clustering problems in the framework proposed by [Dasgupta et al., ICML 2020], where explainability is achieved via axis-aligned decision trees. We consider the $k$-means, $k$-medians, $k$-cen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7293b7dd64622abf88eba7f5efe4971b
http://arxiv.org/abs/2208.09643
http://arxiv.org/abs/2208.09643
Publikováno v:
Discrete Applied Mathematics. 289:503-515
We study the problem of decomposing a graph into stars so that the minimum size star in the decomposition is as large as possible. Problems of graph decomposition have been actively investigated since the 70’s. The question we consider here also co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::42a1c4c61aa148d74b6e6606571cbbd5
https://doi.org/10.1016/j.dam.2020.07.014
https://doi.org/10.1016/j.dam.2020.07.014
Publikováno v:
Theoretical Computer Science. 949:113744
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1d5431917b3ccf1701b95ff8040e5203
https://doi.org/10.1016/j.tcs.2023.113744
https://doi.org/10.1016/j.tcs.2023.113744
Publikováno v:
Algorithmica. 80:3431-3436
This erratum fixes a technical problem in the paper published in Algorithmica, Volume 79, Number 3, November 2017, pp. 886–908. Theorem 1 of this paper gives upper bounds on both worst testing cost and expected testing cost of the decision tree bui
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2b9fc9f251b2b65a57ce4658b8fb1ecf
https://doi.org/10.1007/s00453-018-0423-8
https://doi.org/10.1007/s00453-018-0423-8
Publikováno v:
Information Processing Letters. 127:27-31
Oblivious decision trees are decision trees where every node in the same level is associated with the same attribute. These trees have been studied in the context of feature selection. In this paper, we study the problem of constructing an oblivious
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::49f1777ad0835567094418085f81ee8b
https://doi.org/10.1016/j.ipl.2017.06.011
https://doi.org/10.1016/j.ipl.2017.06.011
Autor:
Lucas Pavanelli, Gabriel Pujol, Hélio Lopes, Pedro Moura, Francisco Thiesen, Eduardo Sany Laber, João Jardim, Daniel Mesejo
Publikováno v:
Computers & Geosciences. 107:49-60
Reservoir modeling is a very important task that permits the representation of a geological region of interest, so as to generate a considerable number of possible scenarios. Since its inception, many methodologies have been proposed and, in the last
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4b81678910f4465446e3f08e87f5da9d
https://doi.org/10.1016/j.cageo.2017.06.013
https://doi.org/10.1016/j.cageo.2017.06.013
Publikováno v:
Anais do Concurso de Teses e Dissertações da SBC (CTD-SBC).
Decision trees are a central structure in computer science, having applications in many areas. This thesis contributes to the understanding of this important structure by proving by proving theoretical bounds on its behavior and also providing algori
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9fc24eb8161f424e7f7d91c99e90d307
https://doi.org/10.5753/ctd.2018.3649
https://doi.org/10.5753/ctd.2018.3649
Publikováno v:
Information Processing Letters. 115:594-599
The cost of a test in a decision tree can depend on its result (value).We provide an O ( log ? ( n ) ) approximation for binary tests and value dependent costs.We provide an n approximation for multiway tests and value dependent costs. We study the p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::17597de17bbe6bad25793f645388e44e
https://doi.org/10.1016/j.ipl.2015.02.006
https://doi.org/10.1016/j.ipl.2015.02.006
An impurity measures $I: \mathbb {R}^{d} \mapsto \mathbb {R}^{+}$ is a function that assigns a $d$ -dimensional vector $\mathbf {v}$ to a non-negative value $I(\mathbf {v})$ so that the more homogeneous $\mathbf {v}$ , with respect to the values of i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5217aad8118510cd6aa54c5903d7adbe
Publikováno v:
DCC
The computation of convolutions is a fundamental problem that arises in applications from different fields as digital signal processing, image processing and string processing, among others. Here, we provide an in-depth investigation of the potential
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9a145d7d64318bad1e5679e69005d1b8
https://doi.org/10.1109/dcc.2016.82
https://doi.org/10.1109/dcc.2016.82