1402 search results - page 243 / 281 » Searching Cycle-Disjoint Graphs |
BMCBI
2008
13 years 10 months ago
2008
Background: Modern omics research involves the application of high-throughput technologies that generate vast volumes of data. These data need to be pre-processed, analyzed and in...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
We study restricted computation models related to the tree evaluation problem. The TEP was introduced in earlier work as a simple candidate for the (very) long term goal of separa...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
The overlap number of a finite (d + 1)-uniform hypergraph H is the largest constant c(H) (0, 1] such that no matter how we map the vertices of H into Rd , there is a point covered...
BMCBI
2007
13 years 10 months ago
2007
Background: Technological advances in high-throughput techniques and efficient data acquisition methods have resulted in a massive amount of life science data. The data is stored ...
JCIT
2008
13 years 10 months ago
2008
Many prominent applications in wireless sensor networks require collected information has to be routed to end nodes in an efficient manner. In general, Connected Dominating Set (C...