11381 search results - page 1987 / 2277 » Connectivity |
163
click to vote
CIKM
2009
Springer
15 years 11 months ago
2009
Springer
Background: Since Swanson proposed the Undiscovered Public Knowledge (UPK) model, there have been many approaches to uncover UPK by mining the biomedical literature. These earlier...
173
click to vote
COCO
2009
Springer
15 years 11 months ago
2009
Springer
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
117
click to vote
COCO
2009
Springer
15 years 11 months ago
2009
Springer
—In 1982, Kannan showed that ΣP 2 does not have nk -sized circuits for any k. Do smaller classes also admit such circuit lower bounds? Despite several improvements of Kannan’s...
136
click to vote
COCOON
2009
Springer
15 years 11 months ago
2009
Springer
In [3], the authors introduced the Generalised Character Compatibility Problem as a generalisation of the Perfect Phylogeny Problem for a set of species. This generalised problem t...
131
click to vote
COMPLEX
2009
Springer
15 years 11 months ago
2009
Springer
By introducing and analyzing a renormalization procedure, Song et al. [1] draw the conclusion that many complex networks exhibit self-repeating patterns on all length scales. First...