4865 search results - page 304 / 973 » The Complexity of Graph Connectivity |
144
click to vote
LREC
2010
15 years 8 months ago
2010
Evaluating complex Natural Language Processing (NLP) systems can prove extremely difficult. In many cases, the best one can do is to evaluate these systems indirectly, by looking ...
195
click to vote
FCT
2005
Springer
16 years 4 days ago
2005
Springer
We present several results on the complexity of various forms of Sperner’s Lemma in the black-box model of computing. We give a deterministic algorithm for Sperner problems over ...
171
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...
184
click to vote
IJCBDD
2010
15 years 5 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...
170
click to vote
RECOMB
2006
Springer
16 years 7 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...