2612 search results - page 132 / 523 » Switching Graphs and Their Complexity |
166
click to vote
EJC
2006
15 years 6 months ago
2006
We study the positive Bergman complex B+ (M) of an oriented matroid M, which is a certain subcomplex of the Bergman complex B(M) of the underlying unoriented matroid M. The positiv...
172
click to vote
IJCBDD
2010
15 years 4 months ago
2010
: The explosion of highthroughput interaction data from proteomics studies gives us the opportunity to integrate Protein-Protein Interactions (PPI) from different type of interacti...
208
click to vote
MOBICOM
2012
ACM
13 years 8 months ago
2012
ACM
While a natural fit for modeling and understanding mobile networks, time-varying graphs remain poorly understood. Indeed, many of the usual concepts of static graphs have no obvi...
157
click to vote
RECOMB
2006
Springer
16 years 6 months ago
2006
Springer
Understanding how individual proteins are organized into complexes and pathways is a significant current challenge. We introduce new algorithms to infer protein complexes by combin...
160
click to vote
SIGIR
2006
ACM
16 years 9 days ago
2006
ACM
We present a novel framework for answering complex questions that relies on question decomposition. Complex questions are decomposed by a procedure that operates on a Markov chain...