Results 31 to 40 of about 33,182 (260)
Determining intrinsic number of clusters in a multidimensional dataset is a commonly encountered problem in exploratory data analysis. Unsupervised clustering algorithms often rely on specification of cluster number as an input parameter.
Osbert C Zalay
doaj +1 more source
The sparse awakens : streaming algorithms for matching size estimation in sparse graphs [PDF]
Estimating the size of the maximum matching is a canonical problem in graph analysis, and one that has attracted extensive study over a range of different computational models.
Muthukrishnan, S. +3 more
core +1 more source
Subexponential-Time Algorithms for Maximum Independent Set in Pt-Free and Broom-Free Graphs [PDF]
In algorithmic graph theory, a classic open question is to determine the complexity of the Maximum Independent Set problem on Pt -free graphs, that is, on graphs not containing any induced path on t vertices.
Lokshtanov, Daniel +6 more
core +2 more sources
Efficient algorithms for generalized Stable Marriage and Roommates problems [PDF]
We consider a generalization of the Stable Roommates problem (SR), in which preference lists may be partially ordered and forbidden pairs may be present, denoted by SRPF.
Irving, R.W. +5 more
core +1 more source
Fluorescent probes allow dynamic visualization of phosphoinositides in living cells (left), whereas mass spectrometry provides high‐sensitivity, isomer‐resolved quantitation (right). Their synergistic use captures complementary aspects of lipid signaling. This review illustrates how these approaches reveal the spatiotemporal regulation and quantitative
Hiroaki Kajiho +3 more
wiley +1 more source
On the Descriptive Complexity of Color Coding
Color coding is an algorithmic technique used in parameterized complexity theory to detect “small” structures inside graphs. The idea is to derandomize algorithms that first randomly color a graph and then search for an easily-detectable, small color ...
Max Bannach, Till Tantau
core +1 more source
The physical dimensions and shape of bacterial cells define the surface area available to acquire nutrients and the volume available for synthesizing proteins and DNA. Here, we use computational systems biology to decode the importance of cell geometry as a major determinant of prokaryotic phenotype, including growth rate and metabolic efficiency. This
Ross P. Carlson +6 more
wiley +1 more source
Interference Aware Inter-Cell Rank Coordination for 5G Systems
Multiple transmit and receive antennas can be used to increase the number of independent streams between a transmitter-receiver pair, and/or to improve the interference resilience with the help of linear minimum mean squared error (MMSE) receivers ...
Nurul Huda Mahmood +2 more
doaj +1 more source
Tumors contain diverse cellular states whose behavior is shaped by context‐dependent gene coordination. By comparing gene–gene relationships across biological contexts, we identify adaptive transcriptional modules that reorganize into distinct vulnerability axes.
Brian Nelson +9 more
wiley +1 more source
Practical large-scale multiple unmanned aerial vehicle (multi-UAV) networks are susceptible to multiple potential points of vulnerability, such as hardware failures or adversarial attacks.
Peng Zhang +4 more
doaj +1 more source

