Author of the publication

deepSA at SemEval-2017 Task 4: Interpolated Deep Neural Networks for Sentiment Analysis in Twitter.

, , and . SemEval@ACL, page 616-620. Association for Computational Linguistics, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Using heuristic and iterative greedy algorithms for the total weighted completion time order scheduling with release times., , , , , and . Swarm Evol. Comput., (2019)Driver Fatigue Prediction Using Different Sensor Data with Deep Learning., , , and . ICPS, page 242-247. IEEE, (2019)Recurrent neural network-based language models with variation in net topology, language, and granularity., , and . IALP, page 71-74. IEEE, (2016)A High Accuracy Constant-On-Time Buck Converter with Spur-Free On-Time Generator., , and . ISCAS, page 1-4. IEEE, (2019)deepSA at SemEval-2017 Task 4: Interpolated Deep Neural Networks for Sentiment Analysis in Twitter., , and . SemEval@ACL, page 616-620. Association for Computational Linguistics, (2017)HEY!: Exploring Virtual Character Interaction for Immersive Storytelling via Electroencephalography., , , , and . SIGGRAPH Asia Posters, page 22:1-22:2. ACM, (2020)Saw It or Triggered It: Exploring the Threshold of Implicit and Explicit Interaction for Eye-tracking Technique in Virtual Reality., , , and . VR Workshops, page 482-483. IEEE, (2021)A Transient-Enhanced Constant On-Time Buck Converter with Light-Load Efficiency Optimization., , and . A-SSCC, page 169-170. IEEE, (2018)Bicriterion total flowtime and maximum tardiness minimization for an order scheduling problem., , , , , and . Comput. Ind. Eng., (2018)Tardiness minimisation for a customer order scheduling problem with sum-of-processing-time-based learning effect., , , , , and . JORS, 70 (3): 487-501 (2019)