We generalize the concept of a cycle from graphs to simplicial complexes. We show that a simplicial cycle is either a sequence of facets connected in the shape of a circle, or is ...
We introduce a new method to derive lower bounds on randomized and quantum communication complexity. Our method is based on factorization norms, a notion from Banach Space theory....
— Estimation of Distribution Algorithm (EDA) is a well-known stochastic optimization technique. The average time complexity is a crucial criterion that measures the performance o...
: Clustering protein-protein interaction networks (PINs) helps to identify complexes that guide the cell machinery. Clustering algorithms often create a flat clustering, without co...
Bill Andreopoulos, Aijun An, Xiangji Huang, Xiaoga...
The article makes use of three different examples (sensory information processing in the rat trigeminal complex, intracellular interaction in snail neurons and multimodal dynamics...
Alexey N. Pavlov, Valeri A. Makarov, Erik Mosekild...