Zobrazeno 1 - 10
of 604
pro vyhledávání: '"Sanka P"'
Autor:
Nutan A. Chavan, Vannavada Sudha Rani, Pooja Shinde, Manohar Shinde, Sanka Pavani, Mote Srinath, Syeda Fakiha Mehreen, Palkonda Shashikala Reddy, Mallika Lavania
Publikováno v:
Heliyon, Vol 10, Iss 11, Pp e32254- (2024)
Viral infection is frequently the cause for acute hemorrhagic conjunctivitis (AHC) epidemics. AHC can result from adenoviruses, with enterovirus 70 and coxsackievirus A24 being the primary agents. AHC was initially identified in Ghana in 1969, caused
Externí odkaz:
https://doaj.org/article/f985d39baacd4527815d2a6458f5631e
Autor:
Chen, Ken, Seneviratne, Sachith, Wang, Wei, Hu, Dongting, Saha, Sanjay, Hasan, Md. Tarek, Rasnayaka, Sanka, Malepathirana, Tamasha, Gong, Mingming, Halgamuge, Saman
Face reenactment refers to the process of transferring the pose and facial expressions from a reference (driving) video onto a static facial (source) image while maintaining the original identity of the source image. Previous research in this domain
Externí odkaz:
http://arxiv.org/abs/2406.13272
Large Language Models (LLMs) represent a leap in artificial intelligence, excelling in tasks using human language(s). Although the main focus of general-purpose LLMs is not code generation, they have shown promising results in the domain. However, th
Externí odkaz:
http://arxiv.org/abs/2401.16186
Autor:
Stragapede, Giuseppe, Vera-Rodriguez, Ruben, Tolosana, Ruben, Morales, Aythami, DeAndres-Tame, Ivan, Damer, Naser, Fierrez, Julian, Garcia, Javier-Ortega, Gonzalez, Nahuel, Shadrikov, Andrei, Gordin, Dmitrii, Schmitt, Leon, Wimmer, Daniel, Grossmann, Christoph, Krieger, Joerdis, Heinz, Florian, Krestel, Ron, Mayer, Christoffer, Haberl, Simon, Gschrey, Helena, Yamagishi, Yosuke, Saha, Sanjay, Rasnayaka, Sanka, Wickramanayake, Sandareka, Sim, Terence, Gutfeter, Weronika, Baran, Adam, Krzyszton, Mateusz, Jaskola, Przemyslaw
This paper describes the results of the IEEE BigData 2023 Keystroke Verification Challenge (KVC), that considers the biometric verification performance of Keystroke Dynamics (KD), captured as tweet-long sequences of variable transcript text from over
Externí odkaz:
http://arxiv.org/abs/2401.16559
Autor:
Armer, Chase, Kane, Hassan, Cortade, Dana, Estell, Dave, Yusuf, Adil, Sanka, Radhakrishna, Redestig, Henning, Brunette, TJ, Kelly, Pete, DeBenedictis, Erika
The grand challenge of protein engineering is the development of computational models that can characterize and generate protein sequences for any arbitrary function. However, progress today is limited by lack of 1) benchmarks with which to compare c
Externí odkaz:
http://arxiv.org/abs/2309.09955
Autor:
Senerath, Dilshan, Tharinda, Sanuja, Vishwajith, Maduka, Rasnayaka, Sanka, Wickramanayake, Sandareka, Meedeniya, Dulani
Continuous Authentication (CA) using behavioural biometrics is a type of biometric identification that recognizes individuals based on their unique behavioural characteristics, like their typing style. However, the existing systems that use keystroke
Externí odkaz:
http://arxiv.org/abs/2307.11000
Autor:
Saha, Sanjay, Perera, Rashindrie, Seneviratne, Sachith, Malepathirana, Tamasha, Rasnayaka, Sanka, Geethika, Deshani, Sim, Terence, Halgamuge, Saman
The recent renaissance in generative models, driven primarily by the advent of diffusion models and iterative improvement in GAN methods, has enabled many creative applications. However, each advancement is also accompanied by a rise in the potential
Externí odkaz:
http://arxiv.org/abs/2305.06564
Autor:
Mohottala, Sanka, Abeygunawardana, Sandun, Samarasinghe, Pradeepa, Kasthurirathna, Dharshana, Abhayaratne, Charith
We present a graph convolutional network with 2D pose estimation for the first time on child action recognition task achieving on par results with an RGB modality based model on a novel benchmark dataset containing unconstrained environment based vid
Externí odkaz:
http://arxiv.org/abs/2212.09027
This paper presents an implementation on child activity recognition (CAR) with a graph convolution network (GCN) based deep learning model since prior implementations in this domain have been dominated by CNN, LSTM and other methods despite the super
Externí odkaz:
http://arxiv.org/abs/2212.09013
Autor:
Sanka, Masahiro, Shan, Songling
Let $G$ be a $t$-tough graph on $n\ge 3$ vertices for some $t>0$. It was shown by Bauer et al. in 1995 that if the minimum degree of $G$ is greater than $\frac{n}{t+1}-1$, then $G$ is hamiltonian. In terms of Ore-type hamiltonicity conditions, the pr
Externí odkaz:
http://arxiv.org/abs/2210.17006