Zobrazeno 1 - 10
of 35
pro vyhledávání: '"T. K. Kumar"'
Autor:
S. K. Koduri, T. K. Kumar
Publikováno v:
Radioengineering, Vol 30, Iss 2, Pp 435-442 (2021)
The limited narrowband frequency range, about 300-3400Hz, used in telephone network channels results in less intelligible and poor-quality telephony speech. To address this drawback, a novel robust speech bandwidth extension using Discrete Wavelet Tr
Externí odkaz:
https://doaj.org/article/b221dec7eccb49f0bf16989815c59051
Autor:
S. R. Bandela, T. K. Kumar
Publikováno v:
Radioengineering, Vol 29, Iss 2, Pp 353-364 (2020)
The use of the combination of different speech features is a common practice to improve the accuracy of Speech Emotion Recognition (SER). Sometimes, this leads to an abrupt increase in the processing time and some of these features contribute less to
Externí odkaz:
https://doaj.org/article/a9a39b9938964d04a53dcb3d8d750a08
Autor:
S. Surendran, T. K. Kumar
Publikováno v:
Radioengineering, Vol 26, Iss 4, Pp 1161-1168 (2017)
In this paper, a subspace speech enhancement method handling colored noise using oblique projection is proposed. Perceptual features and variance normalization are used to reduce residual noise and improve speech intelligibility of the output. Initia
Externí odkaz:
https://doaj.org/article/dfadf6e7cff5437f8f37dc66165b341d
Publikováno v:
Proceedings of the International Symposium on Combinatorial Search. 9:115-123
Local consistency algorithms, like arc consistency (AC) algorithms, are polynomial-time algorithms that prune the search space of constraint satisfaction problems (CSPs). In this paper, we present connections between message passing algorithms and AC
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e5884737ae4ba6290bdde67a8d59cae8
https://doi.org/10.1609/socs.v9i1.18453
https://doi.org/10.1609/socs.v9i1.18453
Publikováno v:
Proceedings of the International Symposium on Combinatorial Search. 10:44-51
Multi-Agent Motion Planning (MAMP) is the task of finding conflict-free kinodynamically feasible plans for agents from start to goal states. While MAMP is of significant practical importance, existing solvers are either incomplete, inefficient or rel
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::46ea2e39a4e59f7722d65e402e16ed54
https://doi.org/10.1609/socs.v10i1.18501
https://doi.org/10.1609/socs.v10i1.18501
Autor:
Liron Cohen, Glenn Wagner, David Chan, Howie Choset, Nathan Sturtevant, Sven Koenig, T. K. Kumar
Publikováno v:
Proceedings of the International Symposium on Combinatorial Search. 9:148-152
Multi-Agent Path Finding (MAPF) is an NP-hard problem that has been well studied in artificial intelligence and robotics. Recently, randomized MAPF solvers have been shown to exhibit heavy-tailed distributions of runtimes, which can be exploited to b
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6dd0b0604b520a4c5fe866d819356123
https://doi.org/10.1609/socs.v9i1.18469
https://doi.org/10.1609/socs.v9i1.18469
Autor:
Tamekia L. Jones, Ashwini D Joshi, Christopher J. Knott-Craig, Simonne S. Nouer, Jerry Allen, Samir Shah, Umar S. Boston, Arun Saini, Susheel T K Kumar, Connor Wayne Gatewood, Krista M Cowan
Publikováno v:
Cardiology in the Young. 29:389-397
ObjectiveShunt-related adverse events are frequent in infants after modified Blalock–Taussig despite use of acetylsalicylic acid prophylaxis. A higher incidence of acetylsalicylic acid-resistance and sub-therapeutic acetylsalicylic acid levels has
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::375a67d503efb74ac9cdf125b410d319
https://doi.org/10.1017/s1047951118002536
https://doi.org/10.1017/s1047951118002536
Publikováno v:
Proceedings of the International Symposium on Combinatorial Search. 11:131-132
In this paper, we formalize and study the Moving Agents in Formation (MAiF) problem, that combines the tasks of finding short collision-free paths for multiple agents and keeping them in close adherence to a desired formation. Previous work includes
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::836966e060fbab296ce8775a5cead9e6
https://doi.org/10.1609/socs.v11i1.18525
https://doi.org/10.1609/socs.v11i1.18525
Publikováno v:
Proceedings of the International Symposium on Combinatorial Search. 10:190-191
The Multi-Agent Pickup and Delivery (MAPD) problem models applications where a large number of agents attend to a stream of incoming pickup-and-delivery tasks. Token Passing (TP) is a recent MAPD algorithm that is efficient and effective. We make TP
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cfb83c9c30c3cad5e73eb01c926a7b31
https://doi.org/10.1609/socs.v10i1.18485
https://doi.org/10.1609/socs.v10i1.18485
Autor:
Sahulee Raj, T K Kumar, Melissa Busovsky-McNeal, Laura Malaga-Dieguez, Yasir Al-Qaqaa, Michelle Ramirez, McKinstry Jaclyn, Sujata Chakravarti, Gefen Ashley
Publikováno v:
Circulation. 142
Introduction: Acute kidney injury (AKI) is a common and serious complication in patients undergoing cardiac surgery and is associated with adverse outcomes. TIMP-2 and IGFBP-7 are cell cycle arrest proteins that are detected in urine during periods o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::62a35e522e1066e52e1096d8b42140e6
https://doi.org/10.1161/circ.142.suppl_3.16941
https://doi.org/10.1161/circ.142.suppl_3.16941