Sciweavers

2125 search results - page 387 / 425
» On Graph Complexity
Sort
View
BMCBI
2010
223views more  BMCBI 2010»
13 years 3 months ago
MetNetGE: interactive views of biological networks and ontologies
Background: Linking high-throughput experimental data with biological networks is a key step for understanding complex biological systems. Currently, visualization tools for large...
Ming Jia, Suh-Yeon Choi, Dirk Reiners, Eve Syrkin ...
DAM
2011
13 years 3 months ago
On minimal Sturmian partial words
Partial words, which are sequences that may have some undefined positions called holes, can be viewed as sequences over an extended alphabet A = A ∪ { }, where stands for a hol...
Francine Blanchet-Sadri, John Lensmire
DIMACS
1996
13 years 10 months ago
Easier Ways to Win Logical Games
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
Ronald Fagin
CGO
2007
IEEE
14 years 21 days ago
Profile-assisted Compiler Support for Dynamic Predication in Diverge-Merge Processors
Dynamic predication has been proposed to reduce the branch misprediction penalty due to hard-to-predict branch instructions. A recently proposed dynamic predication architecture, ...
Hyesoon Kim, José A. Joao, Onur Mutlu, Yale...
CCR
2008
106views more  CCR 2008»
13 years 8 months ago
Message-efficient dissemination for loop-free centralized routing
With steady improvement in the reliability and performance of communication devices, routing instabilities now contribute to many of the remaining service degradations and interru...
Haldane Peterson, Soumya Sen, Jaideep Chandrasheka...