ReP USP - Resultado da busca

Trabalho de evento-resumo
Constant rank constraint qualification for nonlinear second-order cone programming (2023)
Haeser, Gabriel ; Andreani, Roberto ; Mito, Leonardo Makoto ; Ramírez, Héctor ; Silveira, Thiago Parente da
Fonte: Abstracts. Nome do evento: Conference on Optimization - OP23. Unidade: IME
Assunto: PROGRAMAÇÃO NÃO LINEAR
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HAESER, Gabriel et al. Constant rank constraint qualification for nonlinear second-order cone programming. 2023, Anais.. Philadelphia: SIAM, 2023. Disponível em: https://www.siam.org/Portals/0/Conferences/OP/OP23_ABSTRACTS.pdf. Acesso em: 31 out. 2024.
APA
Haeser, G., Andreani, R., Mito, L. M., Ramírez, H., & Silveira, T. P. da. (2023). Constant rank constraint qualification for nonlinear second-order cone programming. In Abstracts. Philadelphia: SIAM. Recuperado de https://www.siam.org/Portals/0/Conferences/OP/OP23_ABSTRACTS.pdf
NLM
Haeser G, Andreani R, Mito LM, Ramírez H, Silveira TP da. Constant rank constraint qualification for nonlinear second-order cone programming [Internet]. Abstracts. 2023 ;[citado 2024 out. 31 ] Available from: https://www.siam.org/Portals/0/Conferences/OP/OP23_ABSTRACTS.pdf
Vancouver
Haeser G, Andreani R, Mito LM, Ramírez H, Silveira TP da. Constant rank constraint qualification for nonlinear second-order cone programming [Internet]. Abstracts. 2023 ;[citado 2024 out. 31 ] Available from: https://www.siam.org/Portals/0/Conferences/OP/OP23_ABSTRACTS.pdf
Trabalho de evento-resumo
A randomized approximation algorithm for the weighted fractional cut-covering problem (2023)
Proença, Nathan Benedetto ; Silva, Marcel Kenji de Carli ; Sato, Cristiane Maria ; Tunçel, Levent
Fonte: Abstracts. Nome do evento: Conference on Optimization - OP23. Unidade: IME
Assuntos: PROGRAMAÇÃO LINEAR, EMPACOTAMENTO E COBERTURA, ALGORITMOS DE APROXIMAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
PROENÇA, Nathan Benedetto et al. A randomized approximation algorithm for the weighted fractional cut-covering problem. 2023, Anais.. Philadelphia: SIAM, 2023. Disponível em: https://www.siam.org/Portals/0/Conferences/OP/OP23_ABSTRACTS.pdf. Acesso em: 31 out. 2024.
APA
Proença, N. B., Silva, M. K. de C., Sato, C. M., & Tunçel, L. (2023). A randomized approximation algorithm for the weighted fractional cut-covering problem. In Abstracts. Philadelphia: SIAM. Recuperado de https://www.siam.org/Portals/0/Conferences/OP/OP23_ABSTRACTS.pdf
NLM
Proença NB, Silva MK de C, Sato CM, Tunçel L. A randomized approximation algorithm for the weighted fractional cut-covering problem [Internet]. Abstracts. 2023 ;[citado 2024 out. 31 ] Available from: https://www.siam.org/Portals/0/Conferences/OP/OP23_ABSTRACTS.pdf
Vancouver
Proença NB, Silva MK de C, Sato CM, Tunçel L. A randomized approximation algorithm for the weighted fractional cut-covering problem [Internet]. Abstracts. 2023 ;[citado 2024 out. 31 ] Available from: https://www.siam.org/Portals/0/Conferences/OP/OP23_ABSTRACTS.pdf
Trabalho de evento-resumo
Block coordinate descent for smooth nonconvex constrained minimization (2023)
Birgin, Ernesto Julian Goldberg ; Martínez, José Mário
Fonte: Abstracts. Nome do evento: Conference on Optimization - OP23. Unidade: IME
Assuntos: PROGRAMAÇÃO NÃO LINEAR, MÉTODOS NUMÉRICOS, PROGRAMAÇÃO MATEMÁTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BIRGIN, Ernesto Julian Goldberg e MARTÍNEZ, José Mário. Block coordinate descent for smooth nonconvex constrained minimization. 2023, Anais.. Philadelphia: SIAM, 2023. Disponível em: https://www.siam.org/Portals/0/Conferences/OP/OP23_ABSTRACTS.pdf. Acesso em: 31 out. 2024.
APA
Birgin, E. J. G., & Martínez, J. M. (2023). Block coordinate descent for smooth nonconvex constrained minimization. In Abstracts. Philadelphia: SIAM. Recuperado de https://www.siam.org/Portals/0/Conferences/OP/OP23_ABSTRACTS.pdf
NLM
Birgin EJG, Martínez JM. Block coordinate descent for smooth nonconvex constrained minimization [Internet]. Abstracts. 2023 ;[citado 2024 out. 31 ] Available from: https://www.siam.org/Portals/0/Conferences/OP/OP23_ABSTRACTS.pdf
Vancouver
Birgin EJG, Martínez JM. Block coordinate descent for smooth nonconvex constrained minimization [Internet]. Abstracts. 2023 ;[citado 2024 out. 31 ] Available from: https://www.siam.org/Portals/0/Conferences/OP/OP23_ABSTRACTS.pdf
Trabalho de evento-resumo
Dynamics of spontaneous activity in networks of two-dimensional integrate-and-fire neurons (2019)
Roque, Antônio Carlos ; Zaks, Michael; Pena, Rodrigo Felipe de Oliveira
Fonte: Abstracts. Nome do evento: Conference on Applications of Dynamical Systems. Unidade: FFCLRP
Assuntos: SINAPSE, NEURÔNIOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ROQUE, Antônio Carlos e ZAKS, Michael e PENA, Rodrigo Felipe de Oliveira. Dynamics of spontaneous activity in networks of two-dimensional integrate-and-fire neurons. 2019, Anais.. Snowbird: SIAM, 2019. Disponível em: https://www.siam.org/Portals/0/Conferences/DS/2019/DS19_Program_AND_Abstracts.pdf?ver=2019-05-17-144328-567. Acesso em: 31 out. 2024.
APA
Roque, A. C., Zaks, M., & Pena, R. F. de O. (2019). Dynamics of spontaneous activity in networks of two-dimensional integrate-and-fire neurons. In Abstracts. Snowbird: SIAM. Recuperado de https://www.siam.org/Portals/0/Conferences/DS/2019/DS19_Program_AND_Abstracts.pdf?ver=2019-05-17-144328-567
NLM
Roque AC, Zaks M, Pena RF de O. Dynamics of spontaneous activity in networks of two-dimensional integrate-and-fire neurons [Internet]. Abstracts. 2019 ;[citado 2024 out. 31 ] Available from: https://www.siam.org/Portals/0/Conferences/DS/2019/DS19_Program_AND_Abstracts.pdf?ver=2019-05-17-144328-567
Vancouver
Roque AC, Zaks M, Pena RF de O. Dynamics of spontaneous activity in networks of two-dimensional integrate-and-fire neurons [Internet]. Abstracts. 2019 ;[citado 2024 out. 31 ] Available from: https://www.siam.org/Portals/0/Conferences/DS/2019/DS19_Program_AND_Abstracts.pdf?ver=2019-05-17-144328-567
Trabalho de evento
Extremal and probabilistic results for order types (2019)
Han, Jie; Kohayakawa, Yoshiharu ; Sales, Marcelo T; Stagni, Henrique
Fonte: Proceedings. Nome do evento: ACM-SIAM Symposium on Discrete Algorithms - SODA. Unidade: IME
Assunto: COMBINATÓRIA PROBABILÍSTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HAN, Jie et al. Extremal and probabilistic results for order types. 2019, Anais.. Philadelphia: SIAM, 2019. Disponível em: https://doi.org/10.1137/1.9781611975482.27. Acesso em: 31 out. 2024.
APA
Han, J., Kohayakawa, Y., Sales, M. T., & Stagni, H. (2019). Extremal and probabilistic results for order types. In Proceedings. Philadelphia: SIAM. doi:10.1137/1.9781611975482.27
NLM
Han J, Kohayakawa Y, Sales MT, Stagni H. Extremal and probabilistic results for order types [Internet]. Proceedings. 2019 ;[citado 2024 out. 31 ] Available from: https://doi.org/10.1137/1.9781611975482.27
Vancouver
Han J, Kohayakawa Y, Sales MT, Stagni H. Extremal and probabilistic results for order types [Internet]. Proceedings. 2019 ;[citado 2024 out. 31 ] Available from: https://doi.org/10.1137/1.9781611975482.27
Trabalho de evento-resumo
On a conjecture in second-order optimality conditions (2017)
Vianna, Daianna S; Behling, Roger; Haeser, Gabriel ; Ramos, Alberto
Fonte: Abstracts. Nome do evento: SIAM Conference on Optimization. Unidade: IME
Assunto: OTIMIZAÇÃO MATEMÁTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
VIANNA, Daianna S et al. On a conjecture in second-order optimality conditions. 2017, Anais.. Philadelphia: SIAM, 2017. Disponível em: https://www.siam.org/meetings/op17/op17_abstracts.pdf. Acesso em: 31 out. 2024.
APA
Vianna, D. S., Behling, R., Haeser, G., & Ramos, A. (2017). On a conjecture in second-order optimality conditions. In Abstracts. Philadelphia: SIAM. Recuperado de https://www.siam.org/meetings/op17/op17_abstracts.pdf
NLM
Vianna DS, Behling R, Haeser G, Ramos A. On a conjecture in second-order optimality conditions [Internet]. Abstracts. 2017 ;[citado 2024 out. 31 ] Available from: https://www.siam.org/meetings/op17/op17_abstracts.pdf
Vancouver
Vianna DS, Behling R, Haeser G, Ramos A. On a conjecture in second-order optimality conditions [Internet]. Abstracts. 2017 ;[citado 2024 out. 31 ] Available from: https://www.siam.org/meetings/op17/op17_abstracts.pdf
Trabalho de evento-resumo
Quadratic regularization with cubic descent for unconstrained optimization (2017)
Birgin, Ernesto Julian Goldberg ; Martinez, José Mario
Fonte: Abstracts. Nome do evento: SIAM Conference on Optimization. Unidade: IME
Assunto: OTIMIZAÇÃO COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BIRGIN, Ernesto Julian Goldberg e MARTINEZ, José Mario. Quadratic regularization with cubic descent for unconstrained optimization. 2017, Anais.. Philadelphia: SIAM, 2017. Disponível em: https://www.siam.org/meetings/op17/op17_abstracts.pdf. Acesso em: 31 out. 2024.
APA
Birgin, E. J. G., & Martinez, J. M. (2017). Quadratic regularization with cubic descent for unconstrained optimization. In Abstracts. Philadelphia: SIAM. Recuperado de https://www.siam.org/meetings/op17/op17_abstracts.pdf
NLM
Birgin EJG, Martinez JM. Quadratic regularization with cubic descent for unconstrained optimization [Internet]. Abstracts. 2017 ;[citado 2024 out. 31 ] Available from: https://www.siam.org/meetings/op17/op17_abstracts.pdf
Vancouver
Birgin EJG, Martinez JM. Quadratic regularization with cubic descent for unconstrained optimization [Internet]. Abstracts. 2017 ;[citado 2024 out. 31 ] Available from: https://www.siam.org/meetings/op17/op17_abstracts.pdf
Trabalho de evento
VolTime: unsupervised anomaly detection on users' online activity volume (2017)
Chino, Daniel Y. T; Costa, Alceu F; Traina, Agma Juci Machado ; Faloutsos, Christos
Fonte: Proceedings. Nome do evento: SIAM International Conference on Data Mining - SDM. Unidade: ICMC
Assuntos: BANCO DE DADOS, RECONHECIMENTO DE PADRÕES
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CHINO, Daniel Y. T et al. VolTime: unsupervised anomaly detection on users' online activity volume. 2017, Anais.. Philadelphia: SIAM, 2017. Disponível em: https://doi.org/10.1137/1.9781611974973.13. Acesso em: 31 out. 2024.
APA
Chino, D. Y. T., Costa, A. F., Traina, A. J. M., & Faloutsos, C. (2017). VolTime: unsupervised anomaly detection on users' online activity volume. In Proceedings. Philadelphia: SIAM. doi:10.1137/1.9781611974973.13
NLM
Chino DYT, Costa AF, Traina AJM, Faloutsos C. VolTime: unsupervised anomaly detection on users' online activity volume [Internet]. Proceedings. 2017 ;[citado 2024 out. 31 ] Available from: https://doi.org/10.1137/1.9781611974973.13
Vancouver
Chino DYT, Costa AF, Traina AJM, Faloutsos C. VolTime: unsupervised anomaly detection on users' online activity volume [Internet]. Proceedings. 2017 ;[citado 2024 out. 31 ] Available from: https://doi.org/10.1137/1.9781611974973.13
Trabalho de evento-resumo
A second-order optimality condition with first and second-order complementarity associated to global convergence of algorithms (2017)
Haeser, Gabriel
Fonte: Abstracts. Nome do evento: SIAM Conference on Optimization. Unidade: IME
Assunto: OTIMIZAÇÃO MATEMÁTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HAESER, Gabriel. A second-order optimality condition with first and second-order complementarity associated to global convergence of algorithms. 2017, Anais.. Philadelphia: SIAM, 2017. Disponível em: https://www.siam.org/meetings/op17/op17_abstracts.pdf. Acesso em: 31 out. 2024.
APA
Haeser, G. (2017). A second-order optimality condition with first and second-order complementarity associated to global convergence of algorithms. In Abstracts. Philadelphia: SIAM. Recuperado de https://www.siam.org/meetings/op17/op17_abstracts.pdf
NLM
Haeser G. A second-order optimality condition with first and second-order complementarity associated to global convergence of algorithms [Internet]. Abstracts. 2017 ;[citado 2024 out. 31 ] Available from: https://www.siam.org/meetings/op17/op17_abstracts.pdf
Vancouver
Haeser G. A second-order optimality condition with first and second-order complementarity associated to global convergence of algorithms [Internet]. Abstracts. 2017 ;[citado 2024 out. 31 ] Available from: https://www.siam.org/meetings/op17/op17_abstracts.pdf
Trabalho de evento
'HALITE IND. DS': fast and scalable subspace clustering for multidimensional data streams (2016)
Silva, Afonso E. da; Sanches, Lucas L; Fraideinberze, Antonio C; Cordeiro, Robson Leonardo Ferreira
Fonte: Proceedings. Nome do evento: SIAM International Conference on Data Mining - SDM. Unidade: ICMC
Assuntos: BANCO DE DADOS, MINERAÇÃO DE DADOS, RECONHECIMENTO DE PADRÕES, CLIMA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SILVA, Afonso E. da et al. 'HALITE IND. DS': fast and scalable subspace clustering for multidimensional data streams. 2016, Anais.. Philadelphia: SIAM, 2016. Disponível em: https://doi.org/10.1137/1.9781611974348.40. Acesso em: 31 out. 2024.
APA
Silva, A. E. da, Sanches, L. L., Fraideinberze, A. C., & Cordeiro, R. L. F. (2016). 'HALITE IND. DS': fast and scalable subspace clustering for multidimensional data streams. In Proceedings. Philadelphia: SIAM. doi:10.1137/1.9781611974348.40
NLM
Silva AE da, Sanches LL, Fraideinberze AC, Cordeiro RLF. 'HALITE IND. DS': fast and scalable subspace clustering for multidimensional data streams [Internet]. Proceedings. 2016 ;[citado 2024 out. 31 ] Available from: https://doi.org/10.1137/1.9781611974348.40
Vancouver
Silva AE da, Sanches LL, Fraideinberze AC, Cordeiro RLF. 'HALITE IND. DS': fast and scalable subspace clustering for multidimensional data streams [Internet]. Proceedings. 2016 ;[citado 2024 out. 31 ] Available from: https://doi.org/10.1137/1.9781611974348.40
Trabalho de evento
Speeding up all-pairwise dynamic time warping matrix calculation (2016)
Silva, Diego Furtado ; Batista, Gustavo Enrique de Almeida Prado Alves
Fonte: Proceedings. Nome do evento: SIAM International Conference on Data Mining - SDM. Unidade: ICMC
Assuntos: INTELIGÊNCIA ARTIFICIAL, RECONHECIMENTO DE PADRÕES, ANÁLISE DE SÉRIES TEMPORAIS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SILVA, Diego Furtado e BATISTA, Gustavo Enrique de Almeida Prado Alves. Speeding up all-pairwise dynamic time warping matrix calculation. 2016, Anais.. Philadelphia: SIAM, 2016. Disponível em: https://doi.org/10.1137/1.9781611974348.94. Acesso em: 31 out. 2024.
APA
Silva, D. F., & Batista, G. E. de A. P. A. (2016). Speeding up all-pairwise dynamic time warping matrix calculation. In Proceedings. Philadelphia: SIAM. doi:10.1137/1.9781611974348.94
NLM
Silva DF, Batista GE de APA. Speeding up all-pairwise dynamic time warping matrix calculation [Internet]. Proceedings. 2016 ;[citado 2024 out. 31 ] Available from: https://doi.org/10.1137/1.9781611974348.94
Vancouver
Silva DF, Batista GE de APA. Speeding up all-pairwise dynamic time warping matrix calculation [Internet]. Proceedings. 2016 ;[citado 2024 out. 31 ] Available from: https://doi.org/10.1137/1.9781611974348.94
Trabalho de evento
Data stream classification guided by clustering on nonstationary environments and extreme verification latency (2015)
Souza, Vinícius M. A; Silva, Diego Furtado ; Gama, João; Batista, Gustavo Enrique de Almeida Prado Alves
Fonte: Proceedings. Nome do evento: SIAM International Conference on Data Mining - SDM. Unidade: ICMC
Assunto: INTELIGÊNCIA ARTIFICIAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SOUZA, Vinícius M. A et al. Data stream classification guided by clustering on nonstationary environments and extreme verification latency. 2015, Anais.. Philadelphia: SIAM, 2015. Disponível em: https://doi.org/10.1137/1.9781611974010.98. Acesso em: 31 out. 2024.
APA
Souza, V. M. A., Silva, D. F., Gama, J., & Batista, G. E. de A. P. A. (2015). Data stream classification guided by clustering on nonstationary environments and extreme verification latency. In Proceedings. Philadelphia: SIAM. doi:10.1137/1.9781611974010.98
NLM
Souza VMA, Silva DF, Gama J, Batista GE de APA. Data stream classification guided by clustering on nonstationary environments and extreme verification latency [Internet]. Proceedings. 2015 ;[citado 2024 out. 31 ] Available from: https://doi.org/10.1137/1.9781611974010.98
Vancouver
Souza VMA, Silva DF, Gama J, Batista GE de APA. Data stream classification guided by clustering on nonstationary environments and extreme verification latency [Internet]. Proceedings. 2015 ;[citado 2024 out. 31 ] Available from: https://doi.org/10.1137/1.9781611974010.98
Trabalho de evento
Density-based clustering validation (2014)
Moulavi, Davoud; Jaskowiak, Pablo A; Campello, Ricardo José Gabrielli Barreto; Zimek, Arthur; Sander, Jörg
Fonte: Proceedings. Nome do evento: SIAM International Conference on Data Mining - SDM. Unidade: ICMC
Assunto: INTELIGÊNCIA ARTIFICIAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MOULAVI, Davoud et al. Density-based clustering validation. 2014, Anais.. Philadelphia: SIAM, 2014. . Acesso em: 31 out. 2024.
APA
Moulavi, D., Jaskowiak, P. A., Campello, R. J. G. B., Zimek, A., & Sander, J. (2014). Density-based clustering validation. In Proceedings. Philadelphia: SIAM.
NLM
Moulavi D, Jaskowiak PA, Campello RJGB, Zimek A, Sander J. Density-based clustering validation. Proceedings. 2014 ;[citado 2024 out. 31 ]
Vancouver
Moulavi D, Jaskowiak PA, Campello RJGB, Zimek A, Sander J. Density-based clustering validation. Proceedings. 2014 ;[citado 2024 out. 31 ]
Monografia/livro
Practical augmented Lagrangian methods for constrained optimization (2014)
Birgin, Ernesto Julian Goldberg ; Martinez, José Mario
Unidade: IME
Assuntos: MÉTODOS NUMÉRICOS DE OTIMIZAÇÃO, ALGORITMOS, OTIMIZAÇÃO MATEMÁTICA, COMPUTAÇÃO APLICADA, PROGRAMAÇÃO MATEMÁTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BIRGIN, Ernesto Julian Goldberg e MARTINEZ, José Mario. Practical augmented Lagrangian methods for constrained optimization. . Philadelphia: SIAM. Disponível em: https://doi.org/10.1137/1.9781611973365. Acesso em: 31 out. 2024. , 2014
APA
Birgin, E. J. G., & Martinez, J. M. (2014). Practical augmented Lagrangian methods for constrained optimization. Philadelphia: SIAM. doi:10.1137/1.9781611973365
NLM
Birgin EJG, Martinez JM. Practical augmented Lagrangian methods for constrained optimization [Internet]. 2014 ;[citado 2024 out. 31 ] Available from: https://doi.org/10.1137/1.9781611973365
Vancouver
Birgin EJG, Martinez JM. Practical augmented Lagrangian methods for constrained optimization [Internet]. 2014 ;[citado 2024 out. 31 ] Available from: https://doi.org/10.1137/1.9781611973365
Trabalho de evento
Probabilistic combination of classifier and cluster ensembles for non-transductive learning (2013)
Acharya, Ayan; Hruschka, Eduardo Raul ; Ghosh, Joydeep; Sarwar, Badrul; Ruvini, Jean-David
Fonte: Proceedings. Nome do evento: SIAM International Conference on Data Mining. Unidade: ICMC
Assunto: INTELIGÊNCIA ARTIFICIAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ACHARYA, Ayan et al. Probabilistic combination of classifier and cluster ensembles for non-transductive learning. 2013, Anais.. Philadelphia: SIAM, 2013. Disponível em: https://doi.org/10.1137/1.9781611972832.32. Acesso em: 31 out. 2024.
APA
Acharya, A., Hruschka, E. R., Ghosh, J., Sarwar, B., & Ruvini, J. -D. (2013). Probabilistic combination of classifier and cluster ensembles for non-transductive learning. In Proceedings. Philadelphia: SIAM. doi:10.1137/1.9781611972832.32
NLM
Acharya A, Hruschka ER, Ghosh J, Sarwar B, Ruvini J-D. Probabilistic combination of classifier and cluster ensembles for non-transductive learning [Internet]. Proceedings. 2013 ;[citado 2024 out. 31 ] Available from: https://doi.org/10.1137/1.9781611972832.32
Vancouver
Acharya A, Hruschka ER, Ghosh J, Sarwar B, Ruvini J-D. Probabilistic combination of classifier and cluster ensembles for non-transductive learning [Internet]. Proceedings. 2013 ;[citado 2024 out. 31 ] Available from: https://doi.org/10.1137/1.9781611972832.32
Trabalho de evento
A novel approximation to dynamic time warping allows anytime clustering of massive time series datasets (2012)
Qiang, Zhu; Batista, Gustavo Enrique de Almeida Prado Alves; Rakthanmanon, Thanawin; Keogh, Eamonn
Fonte: Proceedings. Nome do evento: SIAM International Conference on Data Mining. Unidade: ICMC
Assunto: INTELIGÊNCIA ARTIFICIAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
QIANG, Zhu et al. A novel approximation to dynamic time warping allows anytime clustering of massive time series datasets. 2012, Anais.. Philadelphia: SIAM, 2012. Disponível em: http://siam.omnibooksonline.com/2012datamining/. Acesso em: 31 out. 2024.
APA
Qiang, Z., Batista, G. E. de A. P. A., Rakthanmanon, T., & Keogh, E. (2012). A novel approximation to dynamic time warping allows anytime clustering of massive time series datasets. In Proceedings. Philadelphia: SIAM. Recuperado de http://siam.omnibooksonline.com/2012datamining/
NLM
Qiang Z, Batista GE de APA, Rakthanmanon T, Keogh E. A novel approximation to dynamic time warping allows anytime clustering of massive time series datasets [Internet]. Proceedings. 2012 ;[citado 2024 out. 31 ] Available from: http://siam.omnibooksonline.com/2012datamining/
Vancouver
Qiang Z, Batista GE de APA, Rakthanmanon T, Keogh E. A novel approximation to dynamic time warping allows anytime clustering of massive time series datasets [Internet]. Proceedings. 2012 ;[citado 2024 out. 31 ] Available from: http://siam.omnibooksonline.com/2012datamining/
Trabalho de evento
The maximum size of a Sidon set contained in sparse random set of integers (2011)
Kohayakawa, Yoshiharu ; Lee, Sang June; Rodl, Vojtech
Fonte: proceedings. Nome do evento: ACM-SIAM Symposium on Discrete Algorithms. Unidade: IME
Assunto: ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOHAYAKAWA, Yoshiharu e LEE, Sang June e RODL, Vojtech. The maximum size of a Sidon set contained in sparse random set of integers. 2011, Anais.. Philadelphia: SIAM, 2011. Disponível em: https://dl.acm.org/citation.cfm?id=2133050. Acesso em: 31 out. 2024.
APA
Kohayakawa, Y., Lee, S. J., & Rodl, V. (2011). The maximum size of a Sidon set contained in sparse random set of integers. In proceedings. Philadelphia: SIAM. Recuperado de https://dl.acm.org/citation.cfm?id=2133050
NLM
Kohayakawa Y, Lee SJ, Rodl V. The maximum size of a Sidon set contained in sparse random set of integers [Internet]. proceedings. 2011 ;[citado 2024 out. 31 ] Available from: https://dl.acm.org/citation.cfm?id=2133050
Vancouver
Kohayakawa Y, Lee SJ, Rodl V. The maximum size of a Sidon set contained in sparse random set of integers [Internet]. proceedings. 2011 ;[citado 2024 out. 31 ] Available from: https://dl.acm.org/citation.cfm?id=2133050
Trabalho de evento
On the comparisson of relative clustering validity criteria (2009)
Vendramin, Lucas; Campello, Ricardo José Gabrielli Barreto; Hruschka, Eduardo Raul
Fonte: Proceedings. Nome do evento: SIAM International Conference on Data Mining. Unidade: ICMC
Assunto: INTELIGÊNCIA ARTIFICIAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
VENDRAMIN, Lucas e CAMPELLO, Ricardo José Gabrielli Barreto e HRUSCHKA, Eduardo Raul. On the comparisson of relative clustering validity criteria. 2009, Anais.. Philadelphia: SIAM, 2009. Disponível em: http://www.siam.org/proceedings/datamining/2009/dm09_067_vendraminl.pdf. Acesso em: 31 out. 2024.
APA
Vendramin, L., Campello, R. J. G. B., & Hruschka, E. R. (2009). On the comparisson of relative clustering validity criteria. In Proceedings. Philadelphia: SIAM. Recuperado de http://www.siam.org/proceedings/datamining/2009/dm09_067_vendraminl.pdf
NLM
Vendramin L, Campello RJGB, Hruschka ER. On the comparisson of relative clustering validity criteria [Internet]. Proceedings. 2009 ;[citado 2024 out. 31 ] Available from: http://www.siam.org/proceedings/datamining/2009/dm09_067_vendraminl.pdf
Vancouver
Vendramin L, Campello RJGB, Hruschka ER. On the comparisson of relative clustering validity criteria [Internet]. Proceedings. 2009 ;[citado 2024 out. 31 ] Available from: http://www.siam.org/proceedings/datamining/2009/dm09_067_vendraminl.pdf
Trabalho de evento
Universality of random graphs (2008)
Dellamonica Junior, Domingos; Kohayakawa, Yoshiharu ; RÖdlt, VojtĚch; Ruciński, Andrzej
Fonte: Proceedings. Nome do evento: ACM-SIAM Symposium on Discrete Algorithms - SODA. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
DELLAMONICA JUNIOR, Domingos et al. Universality of random graphs. 2008, Anais.. Philadelphia: SIAM, 2008. Disponível em: https://dl.acm.org/citation.cfm?id=1347168. Acesso em: 31 out. 2024.
APA
Dellamonica Junior, D., Kohayakawa, Y., RÖdlt, V. Ě., & Ruciński, A. (2008). Universality of random graphs. In Proceedings. Philadelphia: SIAM. Recuperado de https://dl.acm.org/citation.cfm?id=1347168
NLM
Dellamonica Junior D, Kohayakawa Y, RÖdlt VĚ, Ruciński A. Universality of random graphs [Internet]. Proceedings. 2008 ;[citado 2024 out. 31 ] Available from: https://dl.acm.org/citation.cfm?id=1347168
Vancouver
Dellamonica Junior D, Kohayakawa Y, RÖdlt VĚ, Ruciński A. Universality of random graphs [Internet]. Proceedings. 2008 ;[citado 2024 out. 31 ] Available from: https://dl.acm.org/citation.cfm?id=1347168
Trabalho de evento
An algorithmic Friedman–Pippenger theorem on tree embeddings and applications to routing (2006)
Dellamonica Junior, Domingos; Kohayakawa, Yoshiharu
Fonte: Proceedings. Nome do evento: ACM-SIAM Symposium on Discrete Algorithms - SODA. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
DELLAMONICA JUNIOR, Domingos e KOHAYAKAWA, Yoshiharu. An algorithmic Friedman–Pippenger theorem on tree embeddings and applications to routing. 2006, Anais.. Philadelphia: SIAM, 2006. Disponível em: https://dl-acm-org.ez67.periodicos.capes.gov.br/citation.cfm?doid=1109557.1109672. Acesso em: 31 out. 2024.
APA
Dellamonica Junior, D., & Kohayakawa, Y. (2006). An algorithmic Friedman–Pippenger theorem on tree embeddings and applications to routing. In Proceedings. Philadelphia: SIAM. Recuperado de https://dl-acm-org.ez67.periodicos.capes.gov.br/citation.cfm?doid=1109557.1109672
NLM
Dellamonica Junior D, Kohayakawa Y. An algorithmic Friedman–Pippenger theorem on tree embeddings and applications to routing [Internet]. Proceedings. 2006 ;[citado 2024 out. 31 ] Available from: https://dl-acm-org.ez67.periodicos.capes.gov.br/citation.cfm?doid=1109557.1109672
Vancouver
Dellamonica Junior D, Kohayakawa Y. An algorithmic Friedman–Pippenger theorem on tree embeddings and applications to routing [Internet]. Proceedings. 2006 ;[citado 2024 out. 31 ] Available from: https://dl-acm-org.ez67.periodicos.capes.gov.br/citation.cfm?doid=1109557.1109672

Unidades USP

ReP

Filtros

Departamento

Autores

Autores USP

Ano de publicação

Assuntos

Título da fonte

Nome do evento

Agência de fomento

Afiliação dos autores externos normalizada

Afiliação dos autores externos não normalizada

País das instituições de afiliação dos autores externos