Sciweavers

5372 search results - page 92 / 1075
» complexity 2007
Sort
View
JSC
2007
84views more  JSC 2007»
13 years 7 months ago
Simplicial cycles and the computation of simplicial trees
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 ...
Massimo Caboara, Sara Faridi, Peter Selinger
STOC
2007
ACM
84views Algorithms» more  STOC 2007»
14 years 8 months ago
Lower bounds in communication complexity based on factorization norms
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....
Nati Linial, Adi Shraibman
CEC
2007
IEEE
14 years 2 months ago
On the analysis of average time complexity of estimation of distribution algorithms
— 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...
Tianshi Chen, Ke Tang, Guoliang Chen, Xin Yao
IJBRA
2007
88views more  IJBRA 2007»
13 years 7 months ago
Finding molecular complexes through multiple layer clustering of protein interaction networks
: 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...
BIB
2006
113views more  BIB 2006»
13 years 7 months ago
Application of wavelet-based tools to study the dynamics of biological processes
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...