Results 81 to 90 of about 22,781,989 (354)
Sensors, 2018 Clustering is the most common method for organizing unlabeled data into its natural groups (called clusters), based on similarity (in some sense or another) among data objects.
Hassan Mushtaq +6 more
doaj +1 more source
Functional variation among LPMOs revealed by the inhibitory effects of cyanide and buffer ions
FEBS Letters, EarlyView.This study addresses the inhibition of lytic polysaccharide monooxygenases (LPMOs) by cyanide and explains how and why the magnitude of observed inhibitory effects depends on the way LPMO reactions are setup and on the type of LPMO. Enzymes known as lytic polysaccharide monooxygenases (LPMOs) are mono‐copper polysaccharide‐degrading peroxygenases that ...
Ole Golten +10 more
wiley +1 more source
Low-complexity iterative detection for orthogonal time frequency space modulation [PDF]
IEEE Wireless Communications and Networking Conference, 2017 We elaborate on the recently proposed orthogonal time frequency space (OTFS) modulation technique, which provides significant advantages over orthogonal frequency division multiplexing (OFDM) in Doppler channels. We first derive the input-output relation
P. Raviteja +4 more
semanticscholar +1 more source
Improved Time Complexities for Learning Boolean Networks
Entropy, 2013 Existing algorithms for learning Boolean networks (BNs) have time complexities of at least O(N · n0:7(k+1)), where n is the number of variables, N is the number of samples and k is the number of inputs in Boolean functions.
Chee Keong Kwoh, Yun Zheng
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
Time complexity analysis of generalized decomposition algorithm [PDF]
, 1997 The time complexity of the fast algorithm for generalized disjunctive decomposition of an rvalued function is studied.The considered algorithm to find the best decomposition is based on the analysis of multiple-terminal multiple-valued decision diagrams.
Kalganova, T, Pshibytko, V
core
Robust Flows over Time: Models and Complexity Results
, 2017 We study dynamic network flows with uncertain input data under a robust optimization perspective. In the dynamic maximum flow problem, the goal is to maximize the flow reaching the sink within a given time horizon $T$, while flow requires a certain ...
Gottschalk, Corinna +5 more
core +1 more source
Characteristics of the Kelch domain containing (KLHDC) subfamily and relationships with diseases
FEBS Letters, EarlyView.The Kelch protein superfamily includes 63 members, with the KLHDC subfamily having 10 proteins. While their functions are not fully understood, recent advances in KLHDC2's structure and role in protein degradation have highlighted its potential for drug development, especially in PROTAC therapies.
Courtney Pilcher +6 more
wiley +1 more source
Insertion of the FeB cofactor in cNORs lacking metal inserting chaperones
FEBS Letters, EarlyView.Nitric oxide reductase is an enzyme found in the bacterial denitrification pathway. The NOR active site contains a non‐heme iron, often, but not always inserted with the assistance of chaperones. Here, we study the insertion of FeB in the subfamily of cNORs lacking chaperones and found a putative channel, conserved in the family, perhaps enabling the ...
Sofia Appelgren, Pia Ädelroth
wiley +1 more source
Complexitor: An Educational Tool for Learning Algorithm Time Complexity in Practical Manner
, 2017 Based on the informal survey, learning algorithm time complexity in a theoretical manner can be rather difficult to understand. Therefore, this research proposed Complexitor, an educational tool for learning algorithm time complexity in a practical ...
E. Elvina, Oscar Karnalim
semanticscholar +1 more source