Sciweavers

4781 search results - page 745 / 957
» Complexity at large
Sort
View
DAC
2006
ACM
14 years 11 months ago
Efficient simulation of critical synchronous dataflow graphs
Simulation and verification using electronic design automation (EDA) tools are key steps in the design process for communication and signal processing systems. The synchronous dat...
Chia-Jui Hsu, José Luis Pino, Ming-Yung Ko,...
BMCBI
2006
129views more  BMCBI 2006»
13 years 10 months ago
Functional clustering of yeast proteins from the protein-protein interaction network
Background: The abundant data available for protein interaction networks have not yet been fully understood. New types of analyses are needed to reveal organizational principles o...
Taner Z. Sen, Andrzej Kloczkowski, Robert L. Jerni...
BMCBI
2006
143views more  BMCBI 2006»
13 years 10 months ago
Fast estimation of the difference between two PAM/JTT evolutionary distances in triplets of homologous sequences
Background: The estimation of the difference between two evolutionary distances within a triplet of homologs is a common operation that is used for example to determine which of t...
Christophe Dessimoz, Manuel Gil, Adrian Schneider,...
JOC
2008
86views more  JOC 2008»
13 years 10 months ago
Lower Bounds and Impossibility Results for Concurrent Self Composition
In the setting of concurrent self composition, a single protocol is executed many times concurrently by a single set of parties. In this paper, we prove lower bounds and impossibi...
Yehuda Lindell
CORR
2011
Springer
202views Education» more  CORR 2011»
13 years 5 months ago
High Degree Vertices, Eigenvalues and Diameter of Random Apollonian Networks
ABSTRACT. Upon the discovery of power laws [8, 16, 30], a large body of work in complex network analysis has focused on developing generative models of graphs which mimick real-wor...
Alan M. Frieze, Charalampos E. Tsourakakis