Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
Material Type: Livro
|
Distributed computing and networking 8th international conference, ICDCN 2006, Guwahati, India, December 27 - 30, 2006 ; proceedingsSamir R Das; Himadri S Paul; Srikanta Tirthapura; Soma Chaudhuri; ICDCN (8 2006.12.27-30 Guwahati); International Conference on Distributed Computing and Networking (8 2006.12.27-30 Guwahati)Berlin u.a. Springer 2006Localização: IME - Inst. Matemática e Estatística (S L471c v.4308 e.2 )(Acessar) |
|
2 |
Material Type: Artigo
|
Stratified random sampling from streaming and stored dataNguyen, Trong Duc ; Shih, Ming-Hung ; Srivastava, Divesh ; Tirthapura, Srikanta ; Xu, BojianDistributed and parallel databases : an international journal, 2021-09, Vol.39 (3), p.665-710 [Periódico revisado por pares]New York: Springer USTexto completo disponível |
|
3 |
Material Type: Artigo
|
Fast Streaming k-Means Clustering with Coreset CachingZhang, Yu ; Tangwongsan, Kanat ; Tirthapura, SrikantaIEEE transactions on knowledge and data engineering, 2022-06, p.1-1 [Periódico revisado por pares]Texto completo disponível |
|
4 |
Material Type: Artigo
|
Enumerating Maximal Bicliques from a Large Graph Using MapReduceMukherjee, Arko Provo ; Tirthapura, SrikantaIEEE transactions on services computing, 2017-09, Vol.10 (5), p.771-784 [Periódico revisado por pares]IEEETexto completo disponível |
|
5 |
Material Type: Artigo
|
Fast Streaming kk-Means Clustering With Coreset CachingZhang, Yu ; Tangwongsan, Kanat ; Tirthapura, SrikantaIEEE transactions on knowledge and data engineering, 2022-06, Vol.34 (6), p.2740-2754 [Periódico revisado por pares]IEEETexto completo disponível |
|
6 |
Material Type: Artigo
|
Incremental maintenance of maximal cliques in a dynamic graphDas, Apurba ; Svendsen, Michael ; Tirthapura, SrikantaThe VLDB journal, 2019-06, Vol.28 (3), p.351-375Berlin/Heidelberg: Springer Berlin HeidelbergTexto completo disponível |
|
7 |
Material Type: Artigo
|
Incremental Maintenance of Maximal Bicliques in a Dynamic Bipartite GraphDas, Apurba ; Tirthapura, SrikantaIEEE transactions on multi-scale computing systems, 2018-07, Vol.4 (3), p.231-242 [Periódico revisado por pares]Piscataway: IEEETexto completo disponível |
|
8 |
Material Type: Artigo
|
Counting and sampling triangles from a graph streamPavan, A. ; Tangwongsan, Kanat ; Tirthapura, Srikanta ; Wu, Kun-LungProceedings of the VLDB Endowment, 2013-09, Vol.6 (14), p.1870-1881 [Periódico revisado por pares]Texto completo disponível |
|
9 |
Material Type: Artigo
|
Mining maximal cliques from a large graph using MapReduce: Tackling highly uneven subproblem sizesSvendsen, Michael ; Mukherjee, Arko Provo ; Tirthapura, SrikantaJournal of parallel and distributed computing, 2015-05, Vol.79-80, p.104-114 [Periódico revisado por pares]Elsevier IncTexto completo disponível |
|
10 |
Material Type: Artigo
|
Mining Largest Maximal Quasi-CliquesSanei-Mehri, Seyed-Vahid ; Das, Apurba ; Hashemi, Hooman ; Tirthapura, SrikantaACM transactions on knowledge discovery from data, 2021-10, Vol.15 (5), p.1-21 [Periódico revisado por pares]Texto completo disponível |