553 search results - page 109 / 111 » Cover Contact Graphs |
SPAA
2010
ACM
13 years 7 months ago
2010
ACM
We develop logarithmic approximation algorithms for extremely general formulations of multiprocessor multiinterval offline task scheduling to minimize power usage. Here each proce...
BMCBI
2010
13 years 7 months ago
2010
Background: Word sense disambiguation (WSD) algorithms attempt to select the proper sense of ambiguous terms in text. Resources like the UMLS provide a reference thesaurus to be u...
BMCBI
2008
13 years 7 months ago
2008
Background: Although there are a large number of thesauri for the biomedical domain many of them lack coverage in terms and their variant forms. Automatic thesaurus construction b...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Contrary to the sequential world, the processes involved in a distributed system do not necessarily know when a computation is globally finished. This paper investigates the proble...
CORR
2010
Springer
13 years 7 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...