ReP USP - Resultado da busca

Trabalho de evento
A parallel algorithm for minimum spanning tree on GPU (2017)
Vasconcellos, Jucele Franca de Alencar; Caceres, Edson Norberto; Mongelli, Henrique; Song, Siang Wun
Source: Proceedings. Conference titles: International Symposium on Computer Architecture and High Performance Computing Workshops. Unidade: IME
Subjects: TEORIA DA COMPUTAÇÃO, ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
VASCONCELLOS, Jucele Franca de Alencar et al. A parallel algorithm for minimum spanning tree on GPU. 2017, Anais.. Los Alamitos: IEEE, 2017. Disponível em: https://doi.org/10.1109/SBAC-PADW.2017.20. Acesso em: 21 out. 2024.
APA
Vasconcellos, J. F. de A., Caceres, E. N., Mongelli, H., & Song, S. W. (2017). A parallel algorithm for minimum spanning tree on GPU. In Proceedings. Los Alamitos: IEEE. doi:10.1109/SBAC-PADW.2017.20
NLM
Vasconcellos JF de A, Caceres EN, Mongelli H, Song SW. A parallel algorithm for minimum spanning tree on GPU [Internet]. Proceedings. 2017 ;[citado 2024 out. 21 ] Available from: https://doi.org/10.1109/SBAC-PADW.2017.20
Vancouver
Vasconcellos JF de A, Caceres EN, Mongelli H, Song SW. A parallel algorithm for minimum spanning tree on GPU [Internet]. Proceedings. 2017 ;[citado 2024 out. 21 ] Available from: https://doi.org/10.1109/SBAC-PADW.2017.20
Trabalho de evento
Algoritmo paralelo para árvore geradora usando GPU (2017)
Vasconcellos, Jucele Franca de Alencar; Caceres, Edson Norberto; Mongelli, Henrique; Song, Siang Wun
Source: Anais do Simpósio de Sistemas Computacionais de Alto Desempenho (WSCAD-WIC). Conference titles: Simpósio de Sistemas Computacionais de Alto Desempenho (WSCAD). Unidade: IME
Subjects: METODOLOGIA E TÉCNICAS DE COMPUTAÇÃO, ALGORITMOS, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
VASCONCELLOS, Jucele Franca de Alencar et al. Algoritmo paralelo para árvore geradora usando GPU. 2017, Anais.. Campinas: Sociedade Brasileira de Computação (SBC), 2017. Disponível em: http://www.lbd.dcc.ufmg.br/colecoes/wscad/2017/025.pdf. Acesso em: 21 out. 2024.
APA
Vasconcellos, J. F. de A., Caceres, E. N., Mongelli, H., & Song, S. W. (2017). Algoritmo paralelo para árvore geradora usando GPU. In Anais do Simpósio de Sistemas Computacionais de Alto Desempenho (WSCAD-WIC). Campinas: Sociedade Brasileira de Computação (SBC). Recuperado de http://www.lbd.dcc.ufmg.br/colecoes/wscad/2017/025.pdf
NLM
Vasconcellos JF de A, Caceres EN, Mongelli H, Song SW. Algoritmo paralelo para árvore geradora usando GPU [Internet]. Anais do Simpósio de Sistemas Computacionais de Alto Desempenho (WSCAD-WIC). 2017 ;[citado 2024 out. 21 ] Available from: http://www.lbd.dcc.ufmg.br/colecoes/wscad/2017/025.pdf
Vancouver
Vasconcellos JF de A, Caceres EN, Mongelli H, Song SW. Algoritmo paralelo para árvore geradora usando GPU [Internet]. Anais do Simpósio de Sistemas Computacionais de Alto Desempenho (WSCAD-WIC). 2017 ;[citado 2024 out. 21 ] Available from: http://www.lbd.dcc.ufmg.br/colecoes/wscad/2017/025.pdf
Trabalho de evento
A parallel maximum subarray algorithm on GPUs (2014)
Ferreira, Cleber S; Camargo, Raphael Yokoingawa de; Song, Siang Wun
Source: Proceedings. Conference titles: International Symposium on Computer Architecture and High Performance Computing Workshops - SBAC-PADW. Unidade: IME
Subjects: ARQUITETURA E ORGANIZAÇÃO DE COMPUTADORES, ALGORITMOS, COMPUTAÇÃO GRÁFICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FERREIRA, Cleber S e CAMARGO, Raphael Yokoingawa de e SONG, Siang Wun. A parallel maximum subarray algorithm on GPUs. 2014, Anais.. Los Alamitos: IEEE, 2014. Disponível em: https://doi.org/10.1109/SBAC-PADW.2014.15. Acesso em: 21 out. 2024.
APA
Ferreira, C. S., Camargo, R. Y. de, & Song, S. W. (2014). A parallel maximum subarray algorithm on GPUs. In Proceedings. Los Alamitos: IEEE. doi:10.1109/SBAC-PADW.2014.15
NLM
Ferreira CS, Camargo RY de, Song SW. A parallel maximum subarray algorithm on GPUs [Internet]. Proceedings. 2014 ;[citado 2024 out. 21 ] Available from: https://doi.org/10.1109/SBAC-PADW.2014.15
Vancouver
Ferreira CS, Camargo RY de, Song SW. A parallel maximum subarray algorithm on GPUs [Internet]. Proceedings. 2014 ;[citado 2024 out. 21 ] Available from: https://doi.org/10.1109/SBAC-PADW.2014.15
Trabalho de evento
Experimental results of a coarse-grained parallel algorithm for spanning tree and connected components (2010)
Cáceres, Edson Norberto; Mongelli, Henrique; Nishibe, Christiane; Song, Siang Wun
Source: Proceedings. Conference titles: International conference on High Peformance Computing and Simulation - HPCS. Unidade: IME
Subjects: ALGORITMOS, ALGORITMOS PARA PROCESSAMENTO, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CÁCERES, Edson Norberto et al. Experimental results of a coarse-grained parallel algorithm for spanning tree and connected components. 2010, Anais.. Piscataway: IEEE, 2010. Disponível em: https://doi.org/10.1109/HPCS.2010.5547062. Acesso em: 21 out. 2024.
APA
Cáceres, E. N., Mongelli, H., Nishibe, C., & Song, S. W. (2010). Experimental results of a coarse-grained parallel algorithm for spanning tree and connected components. In Proceedings. Piscataway: IEEE. doi:10.1109/HPCS.2010.5547062
NLM
Cáceres EN, Mongelli H, Nishibe C, Song SW. Experimental results of a coarse-grained parallel algorithm for spanning tree and connected components [Internet]. Proceedings. 2010 ;[citado 2024 out. 21 ] Available from: https://doi.org/10.1109/HPCS.2010.5547062
Vancouver
Cáceres EN, Mongelli H, Nishibe C, Song SW. Experimental results of a coarse-grained parallel algorithm for spanning tree and connected components [Internet]. Proceedings. 2010 ;[citado 2024 out. 21 ] Available from: https://doi.org/10.1109/HPCS.2010.5547062
Artigo de periodico
Parallel algorithms for maximal cliques in circle graphs and unrestricted depth search (2010)
Cáceres, Edson Norberto; Song, Siang Wun; Szwarcfiter, Jayme Luiz
Source: RAIRO: Theoretical Informatics and Applications. Unidade: IME
Assunto: ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CÁCERES, Edson Norberto e SONG, Siang Wun e SZWARCFITER, Jayme Luiz. Parallel algorithms for maximal cliques in circle graphs and unrestricted depth search. RAIRO: Theoretical Informatics and Applications, v. 44, n. 3, p. 293-312, 2010Tradução . . Disponível em: https://doi.org/10.1051/ita/2010016. Acesso em: 21 out. 2024.
APA
Cáceres, E. N., Song, S. W., & Szwarcfiter, J. L. (2010). Parallel algorithms for maximal cliques in circle graphs and unrestricted depth search. RAIRO: Theoretical Informatics and Applications, 44( 3), 293-312. doi:10.1051/ita/2010016
NLM
Cáceres EN, Song SW, Szwarcfiter JL. Parallel algorithms for maximal cliques in circle graphs and unrestricted depth search [Internet]. RAIRO: Theoretical Informatics and Applications. 2010 ; 44( 3): 293-312.[citado 2024 out. 21 ] Available from: https://doi.org/10.1051/ita/2010016
Vancouver
Cáceres EN, Song SW, Szwarcfiter JL. Parallel algorithms for maximal cliques in circle graphs and unrestricted depth search [Internet]. RAIRO: Theoretical Informatics and Applications. 2010 ; 44( 3): 293-312.[citado 2024 out. 21 ] Available from: https://doi.org/10.1051/ita/2010016
Trabalho de evento
A BSP/CGM algorithm for finding all maximal contiguous subsequences of a sequence of numbers (2006)
Alves, Carlos Eduardo Rodrigues; Cáceres, Edson Norberto ; Song, Siang Wun
Source: Proceedings. Conference titles: European Conference on Parallel Processing - Euro-Par. Unidade: IME
Subjects: TEORIA DA INFORMAÇÃO, TEORIA DOS NÚMEROS, ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ALVES, Carlos Eduardo Rodrigues e CÁCERES, Edson Norberto e SONG, Siang Wun. A BSP/CGM algorithm for finding all maximal contiguous subsequences of a sequence of numbers. 2006, Anais.. Berlin: Springer, 2006. Disponível em: https://doi.org/10.1007/11823285_87. Acesso em: 21 out. 2024.
APA
Alves, C. E. R., Cáceres, E. N., & Song, S. W. (2006). A BSP/CGM algorithm for finding all maximal contiguous subsequences of a sequence of numbers. In Proceedings. Berlin: Springer. doi:10.1007/11823285_87
NLM
Alves CER, Cáceres EN, Song SW. A BSP/CGM algorithm for finding all maximal contiguous subsequences of a sequence of numbers [Internet]. Proceedings. 2006 ;[citado 2024 out. 21 ] Available from: https://doi.org/10.1007/11823285_87
Vancouver
Alves CER, Cáceres EN, Song SW. A BSP/CGM algorithm for finding all maximal contiguous subsequences of a sequence of numbers [Internet]. Proceedings. 2006 ;[citado 2024 out. 21 ] Available from: https://doi.org/10.1007/11823285_87
Artigo de periodico
A coarse-grained parallel algorithm for the all-substrings longest common subsequence problem (2006)
Alves, Carlos Eduardo Rodrigues; Cáceres, Edson Norberto; Song, Siang Wun
Source: Algorithmica. Unidade: IME
Assunto: ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ALVES, Carlos Eduardo Rodrigues e CÁCERES, Edson Norberto e SONG, Siang Wun. A coarse-grained parallel algorithm for the all-substrings longest common subsequence problem. Algorithmica, v. 45, n. 3, p. 301-335, 2006Tradução . . Disponível em: https://doi.org/10.1007/s00453-006-1216-z. Acesso em: 21 out. 2024.
APA
Alves, C. E. R., Cáceres, E. N., & Song, S. W. (2006). A coarse-grained parallel algorithm for the all-substrings longest common subsequence problem. Algorithmica, 45( 3), 301-335. doi:10.1007/s00453-006-1216-z
NLM
Alves CER, Cáceres EN, Song SW. A coarse-grained parallel algorithm for the all-substrings longest common subsequence problem [Internet]. Algorithmica. 2006 ; 45( 3): 301-335.[citado 2024 out. 21 ] Available from: https://doi.org/10.1007/s00453-006-1216-z
Vancouver
Alves CER, Cáceres EN, Song SW. A coarse-grained parallel algorithm for the all-substrings longest common subsequence problem [Internet]. Algorithmica. 2006 ; 45( 3): 301-335.[citado 2024 out. 21 ] Available from: https://doi.org/10.1007/s00453-006-1216-z
Artigo de periodico-apres/intr
Brazilian Symposium on Graphs, Algorithms and Combinatorics. [Preface] (2004)
Reed, Bruce A; Song, Siang Wun; Szwarcfiter, Jayme Luiz
Source: Discrete Applied Mathematics. Unidade: IME
Assunto: ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
REED, Bruce A e SONG, Siang Wun e SZWARCFITER, Jayme Luiz. Brazilian Symposium on Graphs, Algorithms and Combinatorics. [Preface]. Discrete Applied Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/S0166-218X(03)00362-7. Acesso em: 21 out. 2024. , 2004
APA
Reed, B. A., Song, S. W., & Szwarcfiter, J. L. (2004). Brazilian Symposium on Graphs, Algorithms and Combinatorics. [Preface]. Discrete Applied Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/S0166-218X(03)00362-7
NLM
Reed BA, Song SW, Szwarcfiter JL. Brazilian Symposium on Graphs, Algorithms and Combinatorics. [Preface] [Internet]. Discrete Applied Mathematics. 2004 ; 141( 1-3): 1.[citado 2024 out. 21 ] Available from: https://doi.org/10.1016/S0166-218X(03)00362-7
Vancouver
Reed BA, Song SW, Szwarcfiter JL. Brazilian Symposium on Graphs, Algorithms and Combinatorics. [Preface] [Internet]. Discrete Applied Mathematics. 2004 ; 141( 1-3): 1.[citado 2024 out. 21 ] Available from: https://doi.org/10.1016/S0166-218X(03)00362-7
Trabalho de evento-resumo
A parallel algorithm for transitive closure (2002)
Cáceres, Edson Norberto; Song, Siang Wun; Szwarcfiter, Jayme Luiz
Source: Proceedings. Conference titles: IASTED International Conference on Parallel and Distributed Computing and Systems. Unidade: IME
Assunto: ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CÁCERES, Edson Norberto e SONG, Siang Wun e SZWARCFITER, Jayme Luiz. A parallel algorithm for transitive closure. 2002, Anais.. Calgary: IASTED, 2002. . Acesso em: 21 out. 2024.
APA
Cáceres, E. N., Song, S. W., & Szwarcfiter, J. L. (2002). A parallel algorithm for transitive closure. In Proceedings. Calgary: IASTED.
NLM
Cáceres EN, Song SW, Szwarcfiter JL. A parallel algorithm for transitive closure. Proceedings. 2002 ;[citado 2024 out. 21 ]
Vancouver
Cáceres EN, Song SW, Szwarcfiter JL. A parallel algorithm for transitive closure. Proceedings. 2002 ;[citado 2024 out. 21 ]
Relatorio tecnico
A parameterized parallel algorithm for efficient biological sequence comparison (2002)
Alves, Carlos Eduardo Rodrigues; Cáceres, Edson Norberto; Dehne, Frank; Song, Siang Wun
Unidade: IME
Subjects: PROGRAMAÇÃO PARALELA, ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ALVES, Carlos Eduardo Rodrigues et al. A parameterized parallel algorithm for efficient biological sequence comparison. . São Paulo: IME-USP. Disponível em: https://repositorio.usp.br/directbitstream/98a6f33b-7458-44a1-acf7-c0398b22d3a1/1275100.pdf. Acesso em: 21 out. 2024. , 2002
APA
Alves, C. E. R., Cáceres, E. N., Dehne, F., & Song, S. W. (2002). A parameterized parallel algorithm for efficient biological sequence comparison. São Paulo: IME-USP. Recuperado de https://repositorio.usp.br/directbitstream/98a6f33b-7458-44a1-acf7-c0398b22d3a1/1275100.pdf
NLM
Alves CER, Cáceres EN, Dehne F, Song SW. A parameterized parallel algorithm for efficient biological sequence comparison [Internet]. 2002 ;[citado 2024 out. 21 ] Available from: https://repositorio.usp.br/directbitstream/98a6f33b-7458-44a1-acf7-c0398b22d3a1/1275100.pdf
Vancouver
Alves CER, Cáceres EN, Dehne F, Song SW. A parameterized parallel algorithm for efficient biological sequence comparison [Internet]. 2002 ;[citado 2024 out. 21 ] Available from: https://repositorio.usp.br/directbitstream/98a6f33b-7458-44a1-acf7-c0398b22d3a1/1275100.pdf
Trabalho de evento
A CGM/BSP parallel similarity algorithm (2002)
Alves, Carlos Eduardo Rodrigues; Cáceres, Edson Norberto ; Dehne, Frank; Song, Siang Wun
Source: Anais. Conference titles: Workshop Brasileiro de Bioinformática. Unidade: IME
Assunto: ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ALVES, Carlos Eduardo Rodrigues et al. A CGM/BSP parallel similarity algorithm. 2002, Anais.. Porto Alegre: II-UFRGS, 2002. . Acesso em: 21 out. 2024.
APA
Alves, C. E. R., Cáceres, E. N., Dehne, F., & Song, S. W. (2002). A CGM/BSP parallel similarity algorithm. In Anais. Porto Alegre: II-UFRGS.
NLM
Alves CER, Cáceres EN, Dehne F, Song SW. A CGM/BSP parallel similarity algorithm. Anais. 2002 ;[citado 2024 out. 21 ]
Vancouver
Alves CER, Cáceres EN, Dehne F, Song SW. A CGM/BSP parallel similarity algorithm. Anais. 2002 ;[citado 2024 out. 21 ]
Trabalho de evento
Parallel dynamic programing for solving the string editing problem on a CGM/BSP (2002)
Alves, Carlos Eduardo Rodrigues; Cáceres, Edson Norberto; Dehne, Frank; Song, Siang Wun
Source: Proceedings. Conference titles: ACM Symposium on Parallelism in Algorithms and Architectures - SPAA. Unidade: IME
Subjects: ALGORITMOS, PROGRAMAÇÃO DINÂMICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ALVES, Carlos Eduardo Rodrigues et al. Parallel dynamic programing for solving the string editing problem on a CGM/BSP. 2002, Anais.. New York: ACM, 2002. Disponível em: https://doi.org/10.1145/564870.564916. Acesso em: 21 out. 2024.
APA
Alves, C. E. R., Cáceres, E. N., Dehne, F., & Song, S. W. (2002). Parallel dynamic programing for solving the string editing problem on a CGM/BSP. In Proceedings. New York: ACM. doi:10.1145/564870.564916
NLM
Alves CER, Cáceres EN, Dehne F, Song SW. Parallel dynamic programing for solving the string editing problem on a CGM/BSP [Internet]. Proceedings. 2002 ;[citado 2024 out. 21 ] Available from: https://doi.org/10.1145/564870.564916
Vancouver
Alves CER, Cáceres EN, Dehne F, Song SW. Parallel dynamic programing for solving the string editing problem on a CGM/BSP [Internet]. Proceedings. 2002 ;[citado 2024 out. 21 ] Available from: https://doi.org/10.1145/564870.564916
Artigo de periodico
Efficient parallel graph algoritms for coarse-grained multicomputers and BSP (2002)
Dehne, Frank; Ferreira, Afonso Galvão; Cáceres, Edson Norberto; Song, Siang Wun; Roncato, A.
Source: Algorithmica. Unidade: IME
Assunto: ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
DEHNE, Frank et al. Efficient parallel graph algoritms for coarse-grained multicomputers and BSP. Algorithmica, v. 33, n. 2, p. 183-200, 2002Tradução . . Disponível em: https://doi.org/10.1007/s00453-001-0109-4. Acesso em: 21 out. 2024.
APA
Dehne, F., Ferreira, A. G., Cáceres, E. N., Song, S. W., & Roncato, A. (2002). Efficient parallel graph algoritms for coarse-grained multicomputers and BSP. Algorithmica, 33( 2), 183-200. doi:10.1007/s00453-001-0109-4
NLM
Dehne F, Ferreira AG, Cáceres EN, Song SW, Roncato A. Efficient parallel graph algoritms for coarse-grained multicomputers and BSP [Internet]. Algorithmica. 2002 ; 33( 2): 183-200.[citado 2024 out. 21 ] Available from: https://doi.org/10.1007/s00453-001-0109-4
Vancouver
Dehne F, Ferreira AG, Cáceres EN, Song SW, Roncato A. Efficient parallel graph algoritms for coarse-grained multicomputers and BSP [Internet]. Algorithmica. 2002 ; 33( 2): 183-200.[citado 2024 out. 21 ] Available from: https://doi.org/10.1007/s00453-001-0109-4
Relatorio tecnico
A parallel algorithm for transitive closure (2002)
Cáceres, Edson Norberto; Song, Siang Wun; Szwarcfiter, Jayme Luiz
Unidade: IME
Subjects: PROGRAMAÇÃO PARALELA, ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CÁCERES, Edson Norberto e SONG, Siang Wun e SZWARCFITER, Jayme Luiz. A parallel algorithm for transitive closure. . São Paulo: IME-USP. Disponível em: https://repositorio.usp.br/directbitstream/0190a798-52c0-4414-b25b-97592a6345a8/1246829.pdf. Acesso em: 21 out. 2024. , 2002
APA
Cáceres, E. N., Song, S. W., & Szwarcfiter, J. L. (2002). A parallel algorithm for transitive closure. São Paulo: IME-USP. Recuperado de https://repositorio.usp.br/directbitstream/0190a798-52c0-4414-b25b-97592a6345a8/1246829.pdf
NLM
Cáceres EN, Song SW, Szwarcfiter JL. A parallel algorithm for transitive closure [Internet]. 2002 ;[citado 2024 out. 21 ] Available from: https://repositorio.usp.br/directbitstream/0190a798-52c0-4414-b25b-97592a6345a8/1246829.pdf
Vancouver
Cáceres EN, Song SW, Szwarcfiter JL. A parallel algorithm for transitive closure [Internet]. 2002 ;[citado 2024 out. 21 ] Available from: https://repositorio.usp.br/directbitstream/0190a798-52c0-4414-b25b-97592a6345a8/1246829.pdf
Parte de monografia/livro
Parallel graph algorithms for coarse-grained multicomputers (2002)
Song, Siang Wun
Source: Models for parallel and distributed computation : theory, algorithmic techniques and applications. Unidade: IME
Assunto: ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SONG, Siang Wun. Parallel graph algorithms for coarse-grained multicomputers. Models for parallel and distributed computation : theory, algorithmic techniques and applications. Tradução . Boston: Springer, 2002. . Disponível em: https://doi.org/10.1007/978-1-4757-3609-0_6. Acesso em: 21 out. 2024.
APA
Song, S. W. (2002). Parallel graph algorithms for coarse-grained multicomputers. In Models for parallel and distributed computation : theory, algorithmic techniques and applications. Boston: Springer. doi:10.1007/978-1-4757-3609-0_6
NLM
Song SW. Parallel graph algorithms for coarse-grained multicomputers [Internet]. In: Models for parallel and distributed computation : theory, algorithmic techniques and applications. Boston: Springer; 2002. [citado 2024 out. 21 ] Available from: https://doi.org/10.1007/978-1-4757-3609-0_6
Vancouver
Song SW. Parallel graph algorithms for coarse-grained multicomputers [Internet]. In: Models for parallel and distributed computation : theory, algorithmic techniques and applications. Boston: Springer; 2002. [citado 2024 out. 21 ] Available from: https://doi.org/10.1007/978-1-4757-3609-0_6

USP Schools

ReP

Filtros

Document Types

Authors

Date published

Subjects

Source title

Publisher

Conference titles

Countries/Territories

Funding Agencies

Non normalized affiliation