Results 61 to 70 of about 1,536,819 (313)
Efficient Algorithms for Subgraph Listing
Algorithms, 2014 Subgraph isomorphism is a fundamental problem in graph theory. In this paper we focus on listing subgraphs isomorphic to a given pattern graph. First, we look at the algorithm due to Chiba and Nishizeki for listing complete subgraphs of fixed size, and ...
Niklas Zechner, Andrzej Lingas
doaj +1 more source
A Bibliometric Analysis of Publications in Uremic Toxins From 1991 to 2024
Therapeutic Apheresis and Dialysis, EarlyView.ABSTRACT Background Uremic toxins are a growing area of research in nephrology, with significant implications in the progression and treatment of chronic kidney disease (CKD) and the management of end‐stage kidney disease (ESKD). This bibliometric analysis aims to evaluate the global research trends, key contributors, and the impact of publications in ...
Yuh‐Shan Ho +7 more
wiley +1 more source
Reduced-Complexity QAM-Aided Space-Time Shift Keying
, 2011 A novel reduced-complexity near-optimal detection algorithm is proposed for enhancing the recent coherently-detected Space-Time Shift Keying (STSK) scheme employing arbitrary constellations, such as L-point Phase-Shift Keying (PSK) and Quadrature ...
S. Sugiura +5 more
core +1 more source
IEEE Access, 2022 Continuous and low-cost broadcast authentication is a fundamental security service for distributed sensor networks. This paper presents a novel development of a continuous and low-overhead broadcast authentication protocol named enhanced Infinite timed ...
Khouloud Eledlebi +5 more
doaj +1 more source
Therapeutic Apheresis and Dialysis, EarlyView.ABSTRACT Background Therapeutic apheresis (TA) is an established treatment modality for hematologic, neurologic, and immunologic disorders, yet access remains severely limited in sub‐Saharan Africa. Donor apheresis, including platelet apheresis collection from healthy donors, represents an important complementary modality supporting blood product ...
Nosa Bazuaye +33 more
wiley +1 more source
Approximation Algorithms for the Geometric Firefighter and Budget Fence Problems
Algorithms, 2018 Let R denote a connected region inside a simple polygon, P. By building barriers (typically straight-line segments) in P \ R
Rolf Klein +2 more
doaj +1 more source
Theoretical analysis of garden balsam optimization algorithm
Systems Science & Control Engineering, 2022 Garden balsam optimization (GBO) is a new proposed evolutionary algorithm based on swarm intelligence. Convergence and time complexity analyses are very important in evolutionary computation, but the research on GBO is still blank.
Xiaohui Wang, Shengpu Li
doaj +1 more source
On the Subexponential-Time Complexity of CSP
Journal of Artificial Intelligence Research, 2015 Not all NP-complete problems share the same practical hardness with respect to exact computation. Whereas some NP-complete problems are amenable to efficient computational methods, others are yet to show any such sign. It becomes a major challenge to develop a theoretical framework that is more fine-grained than the theory of NP-completeness, and that
Ronald de Haan +2 more
openaire +2 more sources
Time-frequency complexity and information [PDF]
Proceedings of ICASSP '94. IEEE International Conference on Acoustics, Speech and Signal Processing, 2002 Many functions have been proposed for estimating signal information content and complexity on the time-frequency plane, including moment-based measures such as the time-bandwidth product and the Shannon and Renyi(see 4th Berkeley Symp. Math., Stat., Prob., vol.1) entropies.
Patrick Flandrin +2 more
openaire +1 more source
FEBS Letters, EarlyView.Enteropathogenic E. coli (EPEC) infects the human intestinal epithelium, resulting in severe illness and diarrhoea. In this study, we compared the infection of cancer‐derived cell lines with human organoid‐derived models of the small intestine. We observed a delayed in attachment, inflammation and cell death on primary cells, indicating that host ...
Mastura Neyazi +5 more
wiley +1 more source