Results 61 to 70 of about 16,940,234 (305)
A low-cost neural sorting network with O(1) time complexity [PDF]
, 2011 [[abstract]]In this paper, we present an O(1) time neural network with O(n1 + var epsilon) neurons and links to sort n data, var epsilon > 0. For large-size problems, it is desirable to have low-cost hardware solutions.
Lin, Shun-Shii;Hsu, Shen-Hsuan
core
Reduced Complexity Single-Carrier Maximum-Likelihood Detection for Decision Feedback Assisted Space-Time Equalization [PDF]
, 2006 A novel Decision-Feedback (DF) aided reduced complexity Maximum Likelihood (ML) Space-Time Equalizer (STE) designed for single-carrier multiple antenna assisted receivers is introduced. The proposed receiver structure is based on a recursive tree search,
S. Chen +7 more
core +2 more sources
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Latino children are projected to make up nearly one‐third of United States (US) children by 2060, and many of their caregivers speak Spanish. Prior survey research has documented communication difficulties for Spanish‐speaking caregivers of children with cancer, but contemporary qualitative data are limited.
Jenny Ruiz +6 more
wiley +1 more source
Parallel algorithm to find Bayes-Nash solution to the bimatrix informational extended game [PDF]
Computer Science Journal of Moldova, 2018 We propose to use the new methodology for solving the complete and perfect information bimatrix game. To solve the games of these type we construct the incomplete and imperfect information game generated by the informational extended strategies.
Boris Hancu, Anatolie Gladei
doaj
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
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Young adult childhood cancer survivors (YA‐CCS) have an increased risk of treatment‐related health complications throughout their lives. Lifelong survivorship care is recommended, yet many YA‐CCS experience disruptions in care during pediatric‐to‐adult transitions and do not receive recommended survivorship care.
Kevin Shanchen Pu +8 more
wiley +1 more source
Spatial modulation and space-time shift keying: optimal performance at a reduced detection complexity [PDF]
, 2013 —In this paper, we propose a comprehensive reduced-complexity detector both for hard-decision-aided as well as for the soft-decision-assisted Spatial Modulation (SM)/Space-Time Shift Keying (STSK).
Sugiura, Shinya +7 more
core +1 more source
Identifying Patterns of Hospitalizations Among Childhood Cancer Survivors: A Population‐Based Study
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Childhood cancer survivors (CCSs) experience more hospitalizations than the general population. We aimed to identify distinct hospitalization patterns among Queensland CCSs and the associated characteristics. Methods Cases (aged ≤14 years) diagnosed between 1995 and 2019 while residents of Queensland were identified through the ...
Hai Pham +7 more
wiley +1 more source
, 2019 Addressing the management of water bodies that cross political, cultural, and ecological boundaries entails working with a level of complexity that requires creative, adaptive management strategies that build resilience throughout the system and allow ...
Spett, Emma J
core +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