Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Nabizath Saleena"'
Autor:
Nabizath Saleena, Ankit
Publikováno v:
Procedia Computer Science. 132:937-946
Twitter Sentiment Analysis is the way of identifying sentiments and opinions in tweets. The main computational steps in this process are determining the polarity or sentiment of the tweet and then categorizing them into the positive tweet or negative
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c8578d66badfeb621acb2feb44578fce
https://doi.org/10.1016/j.procs.2018.05.109
https://doi.org/10.1016/j.procs.2018.05.109
Autor:
N. K. Muhsina, Nabizath Saleena
Publikováno v:
2017 Second International Conference on Electrical, Computer and Communication Technologies (ICECCT).
The methods for redundancy detection can be classified as lexical approaches and value based approaches. Lexical approaches discover redundancy among lexically identical expressions. Value based approaches discovers redundancy among expressions compu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d528a8af668ebdc89132abc9920c8316
https://doi.org/10.1109/icecct.2017.8117820
https://doi.org/10.1109/icecct.2017.8117820
Autor:
K. A. Ansar, Nabizath Saleena
Publikováno v:
2017 Second International Conference on Electrical, Computer and Communication Technologies (ICECCT).
Redundancy elimination is an important compiler optimization, which deals with the elimination of unnecessary reevaluations of the same computation. This optimization requires two passes — one pass to detect the redundant computations and the secon
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e926212684467046c88424172bf68558
https://doi.org/10.1109/icecct.2017.8117875
https://doi.org/10.1109/icecct.2017.8117875
Autor:
Nabizath Saleena, C M Akhila
Publikováno v:
2016 IEEE Annual India Conference (INDICON).
We present an algorithm for value based redundancy detection in Static Single Assignment(SSA) code. For this, we adopted the idea of Global Value Numbering from the Simple Algorithm for GVN (Saleena and Paleri, 2014). The novel approach is to make us
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::11ee44fcf840f4a74bfc9f56e2798369
https://doi.org/10.1109/indicon.2016.7839019
https://doi.org/10.1109/indicon.2016.7839019
Autor:
Nabizath Saleena, Vineeth Paleri
Publikováno v:
Journal of Information Processing Systems.
Global value numbering (GVN) is a method for detecting equivalent expressions in programs. Most of the GVN algorithms concentrate on detecting equalities among variables and hence, are limited in their ability to identify value-based redundancies. In
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6643103bd230cdb0a715fb13ed259e60
https://doi.org/10.3745/jips.02.0014
https://doi.org/10.3745/jips.02.0014
Autor:
Nabizath Saleena, Vineeth Paleri
Publikováno v:
SAC
Global Value Numbering (GVN) is a method for detecting equivalence among program expressions. Here we consider the problem of GVN in the context of redundancy detection and present a simple, polynomial time algorithm for the same. The basic idea is t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::76a57b906fec51432d14881f729de77b
https://doi.org/10.1145/2554850.2555120
https://doi.org/10.1145/2554850.2555120
Autor:
Shiva Rudrani, Nabizath Saleena
Publikováno v:
2009 Proceeding of International Conference on Methods and Models in Computer Science (ICM2CS).
An m-dimensional top-k query (with m search conditions) is primarily processed by scanning the corresponding m index lists in descending score orders in an interleaved manner (and by making judicious random accesses to look up index entries of specif
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1873b64164b48b4fb6293eaf1c64bac6
https://doi.org/10.1109/icm2cs.2009.5397964
https://doi.org/10.1109/icm2cs.2009.5397964