Zobrazeno 1 - 10
of 17
pro vyhledávání: '"K S Sudeep"'
Publikováno v:
Discrete Applied Mathematics. 319:362-371
An {\em orientation} of an undirected graph $G$ is an assignment of exactly one direction to each edge of $G$. Converting two-way traffic networks to one-way traffic networks and bidirectional communication networks to unidirectional communication ne
Autor:
Swapnil Saurav, K S Sudeep
Publikováno v:
2022 OPJU International Technology Conference on Emerging Technologies for Sustainable Development (OTCON).
Autor:
K. S. Sudeep Kumar, C. R. Rajashekhar
Bio-diesel is a sustainable, renewable and alternate fuel for CI Engines. The use of bio-diesel produces various durability issues on key components of CI engines. Its contribution towards global warming is lesser than that of diesel. For durability
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d36e5a5bd2154962ba9e97745e3cfdf4
https://doi.org/10.9734/bpi/aaer/v6/7642d
https://doi.org/10.9734/bpi/aaer/v6/7642d
Publikováno v:
2020 International Conference on Recent Trends on Electronics, Information, Communication & Technology (RTEICT).
This paper evaluates learning-based data-driven models for deblurring of facial images. Existing algorithms for deblurring, when used for facial images, often fail to preserve the facial shape and identity information. The best available models, whic
Autor:
K. S. Sudeep, Santoshi Sameera Adibhatla, Hema Sai Desu, Sushma Swaroopa Sorda, Phalani Paladugu
Publikováno v:
Advances in Intelligent Systems and Computing ISBN: 9789811514821
World Wide Web (WWW) serves as a platform for retrieving a variety of information. This high volume of information leads to the information overload on the Internet. When a query is made, most search engines return same results to all users without c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ff591ff44c1caa5846952a6681c435bb
https://doi.org/10.1007/978-981-15-1483-8_18
https://doi.org/10.1007/978-981-15-1483-8_18
Publikováno v:
Algorithms and Discrete Applied Mathematics ISBN: 9783030392185
CALDAM
CALDAM
An orientation of an undirected graph G is an assignment of exactly one direction to each edge of G. Converting two-way traffic networks to one-way traffic networks and bidirectional communication networks to unidirectional communication networks are
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a3c70be4904ed2691d64793e461d20ac
https://doi.org/10.1007/978-3-030-39219-2_25
https://doi.org/10.1007/978-3-030-39219-2_25
Publikováno v:
Computers in biology and medicine. 110
Background One of the risk factors for the development of Autism Spectrum Disorder (ASD) is hypothesized to be an imbalance in the gut microbiome. Alterations in the relative numbers of gut microbiota may contribute to such a disruption in normal bac
Publikováno v:
Algorithms and Discrete Applied Mathematics ISBN: 9783030115081
CALDAM
CALDAM
We investigate a method of decomposing a plane near-triangulation G into a collection of induced component subgraphs which we call the W components of the graph. Each W component is essentially a plane near-triangulation with the property that the ne
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0ab8b62c031c0cb583a5dcb70b14f9ee
https://doi.org/10.1007/978-3-030-11509-8_23
https://doi.org/10.1007/978-3-030-11509-8_23
A plane near-triangulation G can be decomposed into a collection of induced subgraphs, described here as the W-components of G, such that G is perfect (respectively, chordal) if and only if each of its W-components is perfect (respectively, chordal).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0320af749af93874e21ff4da9fcf6d62
http://arxiv.org/abs/1701.03447
http://arxiv.org/abs/1701.03447
Autor:
K. S. Sudeep, Prantik Howlader
Publikováno v:
2016 IEEE International Conference on Recent Trends in Electronics, Information & Communication Technology (RTEICT).
In Social Media the directed links formed between the users, are used for the transfer of information. Based on previous research, the rate of information transfer in a social network depends on the strength of connections of the user in the network,