94 search results - page 17 / 19 » A study of the total chromatic number of equibipartite graph... |
COMPGEOM
2010
ACM
14 years 13 days ago
2010
ACM
We study the problem of computing the similarity between two piecewise-linear bivariate functions defined over a common domain, where the surfaces they define in 3D—polyhedral...
BMCBI
2006
13 years 7 months ago
2006
Background: Gene Ontology (GO) terms are often used to assess the results of microarray experiments. The most common way to do this is to perform Fisher's exact tests to find...
ESA
2007
Springer
14 years 1 months ago
2007
Springer
We study the partial capacitated vertex cover problem (pcvc) in which the input consists of a graph G and a covering requirement L. Each edge e in G is associated with a demand (o...
INFOCOM
2002
IEEE
14 years 16 days ago
2002
IEEE
— Most of the currently deployed multicast protocols (e.g. DVMRP, PIM, MOSPF) build one shortest path multicast tree per sender, the tree being rooted at the sender’s subnetwor...
SAC
2005
ACM
14 years 1 months ago
2005
ACM
The popularity of email has triggered researchers to look for ways to help users better organize the enormous amount of information stored in their email folders. One challenge th...